An exact algorithm for the asymmetrical capacitated vehicle routing problem
From MaRDI portal
Publication:3786261
DOI10.1002/net.3230160104zbMath0643.90034OpenAlexW2003071307WikidataQ126263650 ScholiaQ126263650MaRDI QIDQ3786261
Hélène Mercure, Gilbert Laporte, Yves Nobert
Publication date: 1986
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230160104
capacity restrictionsmultiple traveling salesmanasymmetrical capacitated vehicle routingbranch and bound tree
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)
Related Items
An exact algorithm for the capacitated shortest spanning arborescence, Routing problems: A bibliography, Fitness landscape analysis and metaheuristics efficiency, On the exact solution of vehicle routing problems with backhauls, Exact hybrid algorithms for solving a bi-objective vehicle routing problem, The vehicle routing problem: An overview of exact and approximate algorithms, A study on the effect of the asymmetry on real capacitated vehicle routing problems, Models, relaxations and exact approaches for the capacitated vehicle routing problem, Split delivery routing, Branch and cut methods for network optimization, Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs, A way to optimally solve a time-dependent vehicle routing problem with time windows, Robust Optimization of a Broad Class of Heterogeneous Vehicle Routing Problems Under Demand Uncertainty, A heuristic algorithm for the asymmetric capacitated vehicle routing problem, A new subtour elimination constraint for the vehicle routing problem, Vehicle routing with stochastic demands and restricted failures
Cites Work
