Adapting the large neighborhood search to effectively solve pickup and delivery problems with time windows

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2004, Pages 519-523

  Tam, Vincent ^a   Kwan, M C ^a  

^a UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC SEARCH; PICKUP AND DELIVERY PROBLEMS WITH TIME WINDOWS (PDP-TW); PUSH FORWARD INSERTION HEURISTIC (PFIH); VEHICLE ROUTING PROBLEMS (VRP);

CONSTRAINT THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; ITERATIVE METHODS; OPTIMIZATION; PROBLEM SOLVING; RELAXATION PROCESSES; SCHEDULING;

COMBINATORIAL MATHEMATICS;

EID: 16244414624     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2004.23     Document Type: Conference Paper

References (13)

1. Braysy, O.: Genetic Algorithms for the Vehicle Routing Problem with Time Windows. Special issue on Bioinformatics and Genetic Algorithms, Arpakannus 1/2001.
2. Glover, F.: Tabu Search - Part I. ORSA Journal on Computing, Volume 1, Number 3, Summer, 1989.
3. Holland, J.: Adaptation in Naturaland Artificial Systems. University of Michigan Press, Ann Arbor, 1975.
4. Jee, J.: Solving Vehicle Routing Problems with Time Windows using Micro-Genetic Algorithms. Undergraduate Research Opportunity Project (UROP) report, School of Computing, The National University of Singapore, 1999/2000.
5. Kancko, K., Yoshikawa, M., Nakakuki, Y.: Improving a Heuristic Repair Method for Large-Scale School Timetabling Problems. Principles and Practice of Constraint Programming - CP99, 5th International Conference, Alexandria, Virginia, USA, October 11-14, 1999.
6. Lau, H., Liang, Z.: Pickup and Delivery Problems with Time Windows: Algorithms and Test Case Generation, in Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence, Nov 7-9, 2001.
7. Li, H., Lim, A.: A Metaheuristic for the Pickup and Delivery Problem with Time Windows, in Proceedings of the 13th IEEE International Conference on Tools with Artificial Intelligence, Nov 7-9, 2001.
8. Minton, S., Johnston, M., Philips, A., Laird, P.: Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 1992.
9. Prosser, P., Shaw, P.: Study of greedy search with multiple improvement heuristics for vehicle routing problems. Technical Report, RR/96/201, Department of Computer Science, University of Strathclyde, Glasgow, January 1997.
10. Shaw, P.: Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems. Technical Report, RR/98, Department of Computer Science, University of Strathclyde, Glasgow, April 1998.
11. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problem with time windows. Operations Research, 35:254-265, 1987.
12. Tam, V., Tseng, L.: Effective Heuristics to Solve Pickup and Delivery Problems with Time Windows, in Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence, Nov 3-5, 2003.
13. Tsang, E.: Foundations of Constraint Satisfaction. Academic Press, 1993.