Column generation based heuristics for a generalized location routing problem with profits arising in space exploration

DOI10.1016/j.ejor.2012.06.018zbMath1253.90041OpenAlexW2021393190MaRDI QIDQ1926985

Jaemyung Ahn, Yue Geng, Diego Klabjan, Olivier De Weck

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

zbMATH Keywords

heuristicstransportationbranch and boundlocationroutinglogistics

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Related Items (9)

A survey of recent research on location-routing problems ⋮ A survey of variants and extensions of the location-routing problem ⋮ Integrated optimization of planetary rover layout and exploration routes ⋮ The multi-zone location-routing problem with pricing: a flow-based formulation and two heuristic approaches ⋮ Location‐routing problem: a classification of recent research ⋮ Hybrid heuristic for the optimal design of photovoltaic installations considering mismatch loss effects ⋮ The location routing problem using electric vehicles with constrained distance ⋮ A taxonomical analysis, current methods and objectives on location-routing problems ⋮ The vacation planning problem: a multi-level clustering-based metaheuristic approach

Cites Work

• The orienteering problem: a survey
• A branch and cut algorithm for the location-routing problem with simultaneous pickup and delivery
• Iterated local search for the team orienteering problem with time windows
• Location-routing: issues, models and methods
• The selective travelling salesman problem
• 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
• Models and exact solutions for a class of stochastic location-routing problems
• A fast and effective heuristic for the orienteering problem
• Combined location-routing problems: A synthesis and future research directions
• An optimal solution procedure for the multiple tour maximum collection problem using column generation
• A heuristic for the multiple tour maximum collection problem
• Local branching
• A two-phase tabu search approach to the location routing problem
• A TABU search heuristic for the team orienteering problem
• Branch-and-Price: Column Generation for Solving Huge Integer Programs
• Solving a Family of Multi-Depot Vehicle Routing and Location-Routing Problems
• AN ALGORITHM FOR SINGLE CONSTRAINT MAXIMUM COLLECTION PROBLEM
• The prize collecting traveling salesman problem
• Column Generation

This page was built for publication: Column generation based heuristics for a generalized location routing problem with profits arising in space exploration