An exact algorithm for minimizing routing and operating costs in depot location

DOI10.1016/0377-2217(81)90212-5zbMath0451.90047OpenAlexW2015737965MaRDI QIDQ1148218

Yves Nobert, Gilbert Laporte

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0377-2217(81)90212-5

zbMATH Keywords

relaxationexact algorithmdepot locationminimization of operating costsminimization of routing

Mathematics Subject Classification ID

Integer programming (90C10) Inventory, storage, reservoirs (90B05)

Related Items

A new formulation approach for location-routing problems, Distribution network design on the battlefield, A survey of recent research on location-routing problems, Location-routing: issues, models and methods, A branch-and-cut algorithm for the hub location and routing problem, A memetic algorithm for the capacitated location-routing problem with mixed backhauls, Battery swap station location-routing problem with capacitated electric vehicles, Vehicle routing considerations in distribution system design, Variable neighborhood search for location routing, The effect of ignoring routes when locating depots, A Branch-and-Cut method for the Capacitated Location-Routing Problem, Location Science in Canada, A two-stage stochastic location-routing problem for electric vehicles fast charging, Electric vehicles fast charger location-routing problem under ambient temperature, An exact algorithm for minimizing routing and operating costs in depot location, The Hamiltonian p-median problem, Hamiltonian location problems, A hierarchical algorithm for the planar single-facility location routing problem, Distribution network design: New problems and related models, A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery, A branch and bound algorithm for the capacitated vehicle routing problem, Primal-Dual Schema and Lagrangian Relaxation for the k-Location-Routing Problem, Combined location-routing problems -- a neural network approach, Combined location-routing problems: A synthesis and future research directions, A taxonomical analysis, current methods and objectives on location-routing problems, Heuristic solutions to multi-depot location-routing problems, A two-phase tabu search approach to the location routing problem, A heuristic algorithm to solve the single-facility location routing problem on Riemannian surfaces

Cites Work

• Unnamed Item
• An exact algorithm for minimizing routing and operating costs in depot location
• Integer programming approaches to the travelling salesman problem
• Using cutting planes to solve the symmetric Travelling Salesman problem