A metaheuristic to solve a location-routing problem with nonlinear costs
From MaRDI portal
Publication:2491322
DOI10.1007/s10732-005-3601-1zbMath1122.90382OpenAlexW2083030584MaRDI QIDQ2491322
Jan Melechovský, Christian Prins, Roberto Wolfler Calvo
Publication date: 29 May 2006
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-005-3601-1
Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)
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 solution method for a two-layer sustainable supply chain distribution model, A two-phase hybrid heuristic algorithm for the capacitated location-routing problem, An endosymbiotic evolutionary algorithm for the hub location-routing problem, A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study, A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times, Planning a capacitated road network with flexible travel times: a genetic algorithm, Optimization of two-stage location-routing-inventory problem with time-windows in food distribution network, A location-routing problem for the conversion to the ``click-and-mortar retailing: the static case, Introduction of an underground waste container system-model and solution approaches, Mileage bands in freight transportation, A particle swarm optimization algorithm with path relinking for the location routing problem, Solving a bi-objective transportation location routing problem by metaheuristic algorithms, Variable neighbourhood search: methods and applications, Distribution systems design with two-level routing considerations, A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery, Variable neighbourhood search: Methods and applications, A taxonomical analysis, current methods and objectives on location-routing problems
Uses Software
Cites Work
- Unnamed Item
- The effect of ignoring routes when locating depots
- Heuristic solutions to multi-depot location-routing problems
- A two-phase tabu search approach to the location routing problem
- Variable neighborhood decomposition search
- A compact model and tight bounds for a combined location-routing problem
- Diversification strategies in tabu search algorithms for the maximum clique problem
- Variable neighborhood search for the p-median
- Location Models with Routing Considerations for a Single Obnoxious Facility
- Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path
- The symmetric generalized traveling salesman polytope
- Variable neighborhood search: Principles and applications
