Agents toward vehicle routing problem with time windows

Journal of Intelligent Transportation Systems: Technology, Planning, and Operations

Volumn 19, Issue 1, 2015, Pages 3-17

  Kalina, Petr ^a   Vokřínek, Jiří ^a   Mařík, Vladimír ^a  

^a CZECH TECHNICAL UNIVERSITY IN PRAGUE   (Czech Republic)

Author keywords

Abstract Coordination Mechanism; Multi Agent Optimization; Vehicle Routing Problem With Time Windows (VRPTW)

Indexed keywords

MULTI AGENT SYSTEMS; NETWORK ROUTING; ROUTING ALGORITHMS; SEMANTICS; VEHICLE ROUTING; VEHICLES;

AGENT NEGOTIATIONS; CENTRALIZED ALGORITHMS; COORDINATION MECHANISMS; GLOBAL COORDINATION; MULTI AGENT; NEGOTIATION PROCESS; POLYNOMIAL ALGORITHM; VEHICLE ROUTING PROBLEM WITH TIME WINDOWS;

ALGORITHMS;

ALGORITHM; INTELLIGENT TRANSPORTATION SYSTEM; TRANSPORTATION MODE; TRANSPORTATION SAFETY; TRAVEL BEHAVIOR;

EID: 84924044169     PISSN: 15472450     EISSN: 15472442     Source Type: Journal    
DOI: 10.1080/15472450.2014.889953     Document Type: Article

References (38)

1. Bachem, A., Hochstättler, W., & Malich, M. (1996). The simulated trading heuristic for solving vehicle routing problems. Discrete Applied Mathematics, 19, 47-72.
2. Balcik, B., Beamon, B.M., & Smilowitz, K. (2008). Last mile distribution in humanitarian relief. Journal of Intelligent Transportation Systems, 12 (1), 51-63.
3. Barbucha, D. (2009). Simulating activities of the transportation company through multi-agent system solving the dynamic vehicle routing problem. In Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications, KES-AMSTA 09 (pp. 773-782). Berlin, Germany: Springer-Verlag.
4. Bent, R., & Van Hentenryck, P. (2004). A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science, 38 (4), 515-530.
5. Brafman, R.I., & Domshlak, C. (2008). From one to many: Planning for loosely coupled multi-agent systems. In Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, ICAPS 2008, Sydney, Australia, September 14-18, 2008 (pp. 28-35).
6. Braÿsy, O., & Gendreau, M. (2005a). Vehicle routing problem with time windows, part I route construction and local search algorithms. Transportation Science, 39 (1), 104-118.
7. Braÿsy, O., & Gendreau, M. (2005b). Vehicle routing problem with time windows, part II metaheuristics. Transportation Science, 39 (1), 119-139.
8. Campbell, A.M., & Savelsbergh, M. (2004). Efficient insertion heuristics for vehicle routing and scheduling problems. Transportation Science, 38, 369-378.
9. Dan, Z., Cai, L., & Zheng, L. (2009). Improved multi-agent system for the vehicle routing problem with time windows. Tsinghua Science Technology, 14 (3), 407-412.
10. Davidsson, P., Henesey, L., Ramstedt, L., Törnquist, J., & Wernstedt, F. (2005). An analysis of agent-based approaches to transport logistics. Transportation Research Part C: Emerging Technologies, 13 (4), 255-271.
11. Davis, R., & Smith, R.G. (1983). Negotiation as a metaphor for distributed problem solving. Artificial Intelligence, 20, 63-109.
12. Fischer, K., Müller, J.P., & Pischel, M. (1995). Cooperative transportation scheduling: An application domain for DAI. Journal of Applied Artificial Intelligence, 10, 1-33.
13. Gehring, H., & Homberger, J. (2005). A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. European Journal of Operational Research, 162 (1), 220-238.
14. Jakob, M., & Moler, Z. (2013). Modular framework for simulation modelling of interaction-rich transport systems. Retrieved from http://ieeexplore.ieee.org/xpl/login.jsp?tp=&arnumber=6728547&url=http%3A%2F%2Fieeexplore.ieee.org%2Fxpls%2Ficp.jsp%3Farnumber%3D6728547
15. Kalina, P., & Vokřínek, J. (2012). Parallel solver for vehicle routing and pickup and delivery problems with time windows based on agent negotiation. In 2012 IEEE International Conference on Systems, Man, and Cybernetics (SMC) (pp. 1558-1563).
16. Kohout, R., & Erol, K. (1999). In-time agent-based vehicle routing with a stochastic improvement heuristic. In AAAI '99/IAAI '99 Proceedings of the Sixteenth National Conference on Artificial Intelligence and the Eleventh Innovative Applications of Artificial Intelligence Conference Innovative Applications of Artificial Intelligence (pp. 864-869). Menlo Park, CA: AAAI/MIT Press.
17. Komenda, A., Novák, P., & Pechoucek, M. (2014). Domain-independent multi-agent plan repair. Journal of Network and Computer Applications, 37, 76-88.
18. Komenda, A., Vokřínek, J., & Pechoucek, M. (2011). Plan representation and execution in multi-actor scenarios by means of social commitments. Web Intelligence and Agent Systems, 9 (2), 123-133.
19. Leong, H.W., & Liu, M. (2006). A multi-agent algorithm for vehicle routing problem with time window. In Proceedings of the 2006 ACM symposium on Applied computing, SAC 06 (pp. 106-111). New York, NY: ACM.
20. Lim, A., & Zhang, X. (2007). A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows. INFORMS Journal on Computing, 19 (3), 443-457.
21. Liu, F.-H., & Shen, S.-Y. (1999). The fleet size and mix vehicle routing problem with time windows. Operational Research Society, 50, 721-732.
22. Lu, Q., & Dessouky, M.M. (2005). A new insertion-based construction heuristic for solving the pickup and delivery problem with hard time windows. European Journal of Operational Research, 175, 672-687.
23. Mester, D., & Braÿsy, O. (2005). Active guided evolution strategies for large-scale vehicle routing problems with time windows. Computers & Operations Research, 32 (6), 1593-1614.
24. Moscato, P. (1989). On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms. Technical report C3P Report 826. Pasadena, CA: California Institute of Technology.
25. Nagata, Y. (2007). Edge assembly crossover for the capacitated vehicle routing problem. In Proceedings of the 7th European conference on Evolutionary computation in combinatorial optimization, Evo COP07 (pp. 142-153). Berlin, Germany: Springer-Verlag.
26. Nagata, Y., & Braÿsy, O. (2009). A powerful route minimization heuristic for the vehicle routing problem with time windows. Operations Research Letters, 37 (5), 333-338.
27. Nagata, Y., Braÿsy, O., & Dullaert, W. (2010). A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Computers & Operations Research, 37 (4), 724-737.
28. Nissim, R., Brafman, R.I., & Domshlak, C. (2010). A general, fully distributed multi-agent planning algorithm. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, Volume 1, AAMAS 10 (pp. 1323-1330). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.
29. Prescott-Gagnon, E., Desaulniers, G., & Rousseau, L.-M. (2009). A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Network, 54 (4), 190-204.
30. Ren, Y., Dessouky, M., & Ordóñez, F. (2010). The multi-shift vehicle routing problem with overtime. Computers & Operations Research, 37 (11), 1987-1998.
31. Ropke, S. (2005). Heuristic and exact algorithms for vehicle routing problems. PhD thesis, Informatics and Mathematical Modelling, Technical University of Denmark, Kongens Lyngby, Denmark.
32. Sintef TOP. (n.d.). Norway SINTEF Institute, the Transportation Optimization Portal-Problems. Retrieved from http://www.sintef.no/Projectweb/TOP/Problems
33. Skobelev, P. (2011). Multi-agent systems for real time resource allocation, scheduling, optimization and controlling: Industrial applications. In Holonic and multi-agent systems for manufacturing, volume 6867 of Lecture notes in computer science (pp. 1-14). Berlin, Germany: Springer.
34. Solomon, M.M. (1987). Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research, 35, 254-265.
35. Vokřínek, J., Komenda, A., & Pechoucek, M. (2010). Agents towards vehicle routing problems. In Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems, Volume 1, AAMAS 10 (pp. 773-780). Richland, SC: International Foundation for Autonomous Agents and Multiagent Systems.
36. Vokřínek, J., Komenda, A., & Pechoucek, M. (2011). Abstract architecture for task-oriented multi-agent problem solving. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 41 (1), 31-40.
37. Wang, F., Tao, Y., & Shi, N. (2009). A survey on vehicle routing problem with loading constraints. In Proceedings of the 2009 International Joint Conference on Computational Sciences and Optimization, Volume 02, CSO 09 (pp. 602-606). Washington, DC: IEEE Computer Society.
38. Weiss, G., (1999). Multiagent systems: A modern approach to distributed artificial intelligence. Cambridge, MA: MIT Press.