Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

A two-phase algorithm for the partial accessibility constrained vehicle routing problem

  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In the partial accessibility constrained vehicle routing problem, a route can be covered by two types of vehicles, i.e. truck or truck + trailer. Some customers are accessible by both vehicle types, whereas others solely by trucks. After introducing an integer programming formulation for the problem, we describe a two-phase heuristic method which extends a classical vehicle routing algorithm. Since it is necessary to solve a combinatorial problem that has some similarities with the generalized assignment problem, we propose an enumerative procedure in which bounds are obtained from a Lagrangian relaxation. The routine provides very encouraging results on a set of test problems.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. U. Derigs and A. Metz, Über die Matching Relaxation für das Set Partioning Problem, Operations Research Proceedings (1991) 398–406.

  2. U. Derigs and A. Metz, A matching-based approach for solving a delivery/pick-up vehicle routing problem with time constraints, OR Spektrum 14(1992)91–106.

    Article  Google Scholar 

  3. M.L. Fisher, The Lagrangian relaxation method for solving integer programming problems, Management Science 27(1981)1–18.

    Google Scholar 

  4. M.L. Fisher and R. Jaikumar, A generalized assignment heuristic for vehicle routing, Networks 11(1981)109–124.

    Google Scholar 

  5. J.K. Lenstra and A.H.G. Rinnoy Kan, Complexity of vehicle routing and scheduling problems, Networks 11(1981)221–227.

    Google Scholar 

  6. B. Nag, B.L. Golden and A.A. Assad, Vehicle routing with site dependencies, in:Vehicle Routing: Methods and Studies, eds. B.L. Golden and A.A. Assad (Elsevier, Amsterdam, 1988) pp. 149–159.

    Google Scholar 

  7. S. Martello and P. Toth, Knapsack Problems:Algorithms and Computer Implementations (Wiley, Chichester, England, 1990).

    Google Scholar 

  8. Y. Rochat and F. Semet, A tabu search approach for delivering pet food and flour in Switzerland, Journal of the Operational Society 45(1994)1233–1246.

    Google Scholar 

  9. F. Semet and E. Taillard, Solving real-life vehicle routing problems efficiently using tabu search, Annals of Operations Research 41(1993)469–488.

    Article  Google Scholar 

  10. F. Semet and I. Loewenton, The travelling salesman problem under accessibility constraints, rapport ORWP 92/02, Déparatement de Mathématiques, École Polytechnique Fédérale de Lausanne (1992), conditionally accepted in INFOR.

Download references

Author information

Authors and Affiliations

  1. Centre de recherche sur les transports, Université de Montréal, succ. “Centre-Ville”, C.P. 6128, H3C 3J7, Montréal, Canada

    Frédéric Semet

Authors
  1. Frédéric Semet
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Semet, F. A two-phase algorithm for the partial accessibility constrained vehicle routing problem. Ann Oper Res 61, 45–65 (1995). https://doi.org/10.1007/BF02098281

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02098281

Keywords

Search

Navigation