Minimum Makespan Vehicle Routing Problem with Compatibility Constraints

We study a multiple vehicle routing problem, in which a fleet of vehicles is available to serve different types of services demanded at locations. The goal is to minimize the makespan, i.e. the maximum length of any vehicle route. We formulate it as a mixed-integer linear program and propose a branc...

Full description

Saved in:
Bibliographic Details
Published inIntegration of AI and OR Techniques in Constraint Programming Vol. 10335; pp. 244 - 253
Main Authors Yu, Miao, Nagarajan, Viswanath, Shen, Siqian
Format Book Chapter
LanguageEnglish
Published Switzerland Springer International Publishing AG 2017
Springer International Publishing
SeriesLecture Notes in Computer Science
Subjects
Approximation algorithm
Branch-cut-and-price
Compatibility constraints
Vehicle routing
Online AccessGet full text
ISBN9783319597751
3319597752
ISSN0302-9743
1611-3349
DOI10.1007/978-3-319-59776-8_20

Cover

More Information
Summary:We study a multiple vehicle routing problem, in which a fleet of vehicles is available to serve different types of services demanded at locations. The goal is to minimize the makespan, i.e. the maximum length of any vehicle route. We formulate it as a mixed-integer linear program and propose a branch-cut-and-price algorithm. We also develop an efficient $$O(\log n)$$ -approximation algorithm for this problem. We conduct numerical studies on Solomon’s instances with various demand distributions, network topologies, and fleet sizes. Results show that the approximation algorithm solves all the instances very efficiently and produces solutions with good practical bounds.
Bibliography:Original Abstract: We study a multiple vehicle routing problem, in which a fleet of vehicles is available to serve different types of services demanded at locations. The goal is to minimize the makespan, i.e. the maximum length of any vehicle route. We formulate it as a mixed-integer linear program and propose a branch-cut-and-price algorithm. We also develop an efficient \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$O(\log n)$$\end{document}-approximation algorithm for this problem. We conduct numerical studies on Solomon’s instances with various demand distributions, network topologies, and fleet sizes. Results show that the approximation algorithm solves all the instances very efficiently and produces solutions with good practical bounds.
ISBN:9783319597751
3319597752
ISSN:0302-9743
1611-3349
DOI:10.1007/978-3-319-59776-8_20