Column generation based heuristics for a generalized location routing problem with profits arising in space exploration
DOI10.1016/J.EJOR.2012.06.018zbMATH Open1253.90041OpenAlexW2021393190MaRDI QIDQ1926985FDOQ1926985
Authors: Jaemyung Ahn, O. L. de Weck, Yue Geng, Diego Klabjan 
Publication date: 29 December 2012
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2012.06.018
Recommendations
- Column generation based primal heuristics for routing and loading problems
- A heuristic for cumulative vehicle routing using column generation
- A column generation approach for location-routing problems with pickup and delivery
- A column generation approach for the location-routing problem with time windows
- Column generation based heuristic for tactical planning in multi-period vehicle routing
- A column generation approach to the heterogeneous fleet vehicle routing problem
- Performances improvement of the column generation algorithm: application to vehicle routing problems
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Transportation, logistics and supply chain management (90B06)
Cites Work
- The prize collecting traveling salesman problem
- The orienteering problem: a survey
- Models and exact solutions for a class of stochastic location-routing problems
- Combined location-routing problems: A synthesis and future research directions
- Local branching
- Branch-and-price: Column generation for solving huge integer programs
- Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
- A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
- Location-routing: issues, models and methods
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- A GRASP\(\times \)ELS approach for the capacitated location-routing problem
- A two-phase tabu search approach to the location routing problem
- Column Generation
- A fast and effective heuristic for the orienteering problem
- Iterated local search for the team orienteering problem with time windows
- The selective travelling salesman problem
- A TABU search heuristic for the team orienteering problem
- A heuristic for the multiple tour maximum collection problem
- An optimal solution procedure for the multiple tour maximum collection problem using column generation
- AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
Cited In (9)
- A taxonomical analysis, current methods and objectives on location-routing problems
- The vacation planning problem: a multi-level clustering-based metaheuristic approach
- A survey of recent research on location-routing problems
- Integrated optimization of planetary rover layout and exploration routes
- Hybrid heuristic for the optimal design of photovoltaic installations considering mismatch loss effects
- The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches
- Location‐routing problem: a classification of recent research
- The location routing problem using electric vehicles with constrained distance
- A survey of variants and extensions of the location-routing problem
This page was built for publication: Column generation based heuristics for a generalized location routing problem with profits arising in space exploration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1926985)
