A set covering approach for the pickup and delivery problem with general constraints on each route

  • Authors:

  • Hideki Hashimoto;Youichi Ezaki;Mutsunori Yagiura;Koji Nonobe;Toshihide Ibaraki;Arne Løkketangen

  • Affiliations:

  • Graduate School of Informatics, Kyoto University, Kyoto, Japan;Canon System Solutions Inc., Japan;Graduate School of Information Science, Nagoya University, Nagoya, Japan;Faculty of Engineering, Hosei University, Koganei, Japan;School of Science and Technology, Kwansei Gakuin University, Sanda, Japan;Molde University College, Molde, Norway

  • Venue:
  • SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider a generalization of the pickup and delivery problem with time windows by allowing general constraints on each route, and propose a heuristic algorithm based on the set covering approach, in which all requests are required to be covered by a set of feasible routes. Our algorithm first generates a set of feasible routes, and repeats reconstructing of the set by using information from a Lagrangian relaxation of the set covering problem corresponding to the set. The algorithm then solves the resulting set covering problem instance to find a good feasible solution for the original problem. We conduct computational experiments for instances with various constraints and confirm the flexibility and robustness of our algorithm.