Integer linear programming formulation for a vehicle routing problem

DOI10.1016/0377-2217(91)90338-VzbMATH Open0727.90059OpenAlexW2005195079MaRDI QIDQ804473FDOQ804473

N. R. Achuthan, Louis Caccetta

Publication date: 1991

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(91)90338-v

zbMATH Keywords

mixed integer linear programmingvehicle routingcombinatorial analysis

Mathematics Subject Classification ID

Linear programming (90C05) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Cites Work

• Title not available (Why is that?)
• Integer Programming Formulation of Traveling Salesman Problems
• Optimal Routing under Capacity and Distance Restrictions
• Integer linear programming formulation for vehicle routing problems

Cited In (9)

• A remark on ``Integer linear programming formulation for a vehicle routing problem by N. R. Achutan and L. Caccetta, or how to use the Clark \(\&\) Wright savings to write such integer linear programming formulations
• Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints
• Solving 0-1 programming problems by a penalty approach.
• Integer linear programming models for global routing
• A new subtour elimination constraint for the vehicle routing problem
• Routing problems: A bibliography
• A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands
• The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations
• Siting recycling drop-off stations in urban area by genetic algorithm-based fuzzy multiobjective nonlinear integer programming modeling

This page was built for publication: Integer linear programming formulation for a vehicle routing problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q804473)