The simulated trading heuristic for solving vehicle routing problems
Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Reference architecture for holonic manufacturing systems: PROSA
Computers in Industry - Special issue on manufacturing systems
The vehicle routing problem
A multi-agent algorithm for vehicle routing problem with time window
Proceedings of the 2006 ACM symposium on Applied computing
Proceedings of the 40th Conference on Winter Simulation
Agents towards vehicle routing problems
Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1
An ant colony optimization approach to solve cooperative transportation planning problems
Winter Simulation Conference
| Hi-index | 0.00 |
In this paper, we describe a cooperative transportation planning problem that is motivated by a real-world setting found in the German food industry. Several manufacturers with joint customers but complementary food products share their fleets to deliver the customers. After an appropriate hierarchical decomposition of the transportation planning problem into subproblems, a set of rich vehicle routing problems with time windows for the delivery of the orders, capacity constraints, maximum operating times for the vehicles, and outsourcing options is obtained. These subproblems are solved by an Ant Colony System (ACS). A multi-agent-system (MAS) is proposed that differentiates between decision-making and staff agents. It improves solutions by exchanging appropriate orders between subproblems. Furthermore, it allows working with local data. Some results of simulation experiments with the MAS are presented.