An exact algorithm for the asymmetrical capacitated vehicle routing problem
DOI10.1002/NET.3230160104zbMATH Open0643.90034OpenAlexW2003071307WikidataQ126263650 ScholiaQ126263650MaRDI QIDQ3786261FDOQ3786261
Authors: G. Laporte, Hélène Mercure, 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
Recommendations
- A branch-and-bound algorithm for the asymmetrical distance-constrained vehicle routing problem
- scientific article; zbMATH DE number 4047425
- A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
capacity restrictionsmultiple traveling salesmanasymmetrical capacitated vehicle routingbranch and bound tree
Numerical mathematical programming methods (65K05) Programming involving graphs or networks (90C35) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
Cited In (24)
- Robust optimization of a broad class of heterogeneous vehicle routing problems under demand uncertainty
- Models, relaxations and exact approaches for the capacitated vehicle routing problem
- The vehicle routing problem: An overview of exact and approximate algorithms
- A matheuristic for the asymmetric capacitated vehicle routing problem
- Facets of the polytope of the asymmetric travelling salesman problem with replenishment arcs
- Vehicle routing with stochastic demands and restricted failures
- A study on the effect of the asymmetry on real capacitated vehicle routing problems
- An exact algorithm for the capacitated shortest spanning arborescence
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- A heuristic algorithm for the asymmetric capacitated vehicle routing problem
- Exact hybrid algorithms for solving a bi-objective vehicle routing problem
- A new subtour elimination constraint for the vehicle routing problem
- Tolerance-based vs. cost-based branching for the asymmetric capacitated vehicle routing problem
- Routing problems: A bibliography
- Split delivery routing
- Branch and cut methods for network optimization
- On the exact solution of vehicle routing problems with backhauls
- A Branch and Bound Algorithm for a Class of Asymmetrical Vehicle Routeing Problems
- A way to optimally solve a time-dependent vehicle routing problem with time windows
- Fitness landscape analysis and metaheuristics efficiency
- Das tourenproblem mit fahrzeugen untersehiedlicher ladekapazität
- Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
- Title not available (Why is that?)
- Multistart Branch and Bound for Large Asymmetric Distance-Constrained Vehicle Routing Problem
This page was built for publication: An exact algorithm for the asymmetrical capacitated vehicle routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3786261)
