A non-dominated sorting genetic algorithm for a bi-objective pick-up and delivery problem

References

• Conover , W. 1998 . Practical nonparametric statistics , Hoboken , NJ : John Wiley and Sons .
   Google Scholar
• Cordeau , J. 2005 . “ Transportation on demand ” . In Transportation, handbooks in operations research and management science , Edited by: Barnhart , C. and Laporte , G. Amsterdam : Elsevier .
   Google Scholar
• Cormen , T. , Leiserson , C. and Rivest , R. 1990 . Introduction to algorithms , Cambridge , MA : MIT Press .
   Google Scholar
• Deb , K. 2001 . Multi-objective optimization using evolutionary algorithms , Hoboken , NJ : John Wiley and Sons .
   Google Scholar
• Desaulniers , G. 2001 . “ VRP with pickup and delivery ” . In The vehicle routing problem , Edited by: Toth , P. and Vigo , D. 225 – 242 . Philadelphia , PA : Society for Industrial and Applied Mathematics .
   Google Scholar
• Dumas , Y. , Desrosiers , J. and Soumis , F. 1991 . The pickup and delivery problem with time windows . European Journal of Operational Research , 54 ( 1 ) : 7 – 22 .
   Web of Science ®Google Scholar
• Jaw , J. 1986 . A heuristic algorithm for the multi-vehicle advance request dial-a-ride problem with time windows . Transportation Research Part B: Methodological , 20 ( 3 ) : 243 – 257 .
   Web of Science ®Google Scholar
• Jih , W. and Hsu , J. Dynamic vehicle routing using hybrid genetic algorithms . Proceedings of IEEE international conference on robotics and automation (ICRA) . May 10–15 , Detroit , MI . Vol. 1 , pp. 453 – 458 . New York : IEEE Press .
   Google Scholar
• Jozefowiez , N. , Semet , F. and Talbi , E. G. 2008 . Multi-objective vehicle routing problems . European Journal of Operational Research , 189 ( 2 ) : 293 – 309 .
   Web of Science ®Google Scholar
• Jung , S. and Haghani , A. 2000 . Genetic algorithm for a pick-up and delivery problem with time windows . Transportation Research Record, TRB , : 1 – 7 .
   Web of Science ®Google Scholar
• Lacomme , P. , Prins , C. and Sevaux , M. 2006 . A genetic algorithm for a bi-objective capacitated arc routing problem . Computer and Operations Researchs , 33 ( 12 ) : 3473 – 3493 .
   Web of Science ®Google Scholar
• Li , H. and Lim , A. A metaheuristic for the pickup and delivery problem with time windows . Proceedings of 13th IEEE international conference on tools with artificial intelligence (ICTAI) . November 7–9 . pp. 160 – 167 . Dallas , TX
   Google Scholar
• Lim , H. , Lim , A. and Rodrigues , B. Solving the pickup and delivery problem with time windows using squeaky wheel optimization with local search . Proceedings of American conference on information systems (AMCIS) . August 9–11 , Dallas , TX .
   Google Scholar
• Parragh , S. N. , Doerner , K. F. and Hartl , R. F. 2008a . A survey on pickup and delivery problems. Part I: Transportation between customers and depot . Journal für Betriebswirtschaft , 51 ( 1 ) : 21 – 51 .
   Google Scholar
• Parragh , S. N. , Doerner , K. F. and Hartl , R. F. 2008b . A survey on pickup and delivery problems. Part II: Transportation between pickup and delivery locations . Journal für Betriebswirtschaft , 51 ( 2 ) : 81 – 117 .
   Google Scholar
• Parragh , S. N. 2009 . A heuristic two-phase solution approach for the multi-objective dial-a-ride problem . Networks , 54 ( 4 ) : 227 – 242 .
   Web of Science ®Google Scholar
• Prud'Homme , C. Heuristiques pour un problème réel de tournées d'hélicoptères de type pick-up and delivery. Technical report 04/5/AUTO. École des Mines de Nantes .
   Google Scholar
• Riise , A. Comparing genetic algorithms and tabu search for multiobjective optimization . IFORS abstract conference proceedings . July 8–12 . pp. 29 Edinburgh , , UK
   Google Scholar
• Sol , M. and Savelsbergh , M. 1994 . “ A branch-and-price algorithm for the pickup and delivery problem with time windows. COSOR Memorandum 94–22 ” . Eindhoven , , The Netherlands : Department of Mathematics and Computing Science, Eindhoven University of Technology .
   Google Scholar
• Velasco , N. 2008 . “ A memetic algorithm for a pickup and delivery problem by helicopter ” . In Bio-inspired algorithms for the vehicle routing problem , Edited by: Pereira , F. and Tavares , J. 173 – 190 . Berlin : Springer-Verlag . Studies in computational intelligence 161.
   Google Scholar
• Wolfler-Calvo , R. and Colorni , A. 2007 . An effective and fast heuristic for the dial-a-ride problem . 4OR , 5 ( 1 ) : 61 – 73 .
   Web of Science ®Google Scholar
• Zitzler , E. 1999 . “ Evolutionary algorithms for multiobjective optimization: methods and applications ” . Zürich , , Switzerland : Swiss Federal Institute of Technology (ETH) . Thesis (PhD).
   Google Scholar
• Zitzler , E. and Thiele , L. 1999 . Multiobjective evolutionary algorithms: a comparative case study and the strength Pareto approach . IEEE Transactions on Evolutionary Computation , 3 ( 4 ) : 257 – 271 .
   Web of Science ®Google Scholar