A Fast Greedy Algorithm for the Relocation Problem

DOI10.1007/978-3-319-28697-6_89MaRDI QIDQ2807030zbMATH OpenOpenAlexFDO

Authors Rabih Zakaria, Laurent Moalic, Mohammad Dib, Alexandre Caminada

Publication date 19 May 2016

Published in Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-28697-6_89

zbMATH Keywords

CPLEX

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06)

Recommendations

• A fast feasibility test for relocation problems
• A fast algorithm for the rectilinear distance location problem
• Solving the container relocation problem by an improved greedy look-ahead heuristic
• An exact algorithm for the unrestricted block relocation problem
• Greedy algorithms for the single-demand facility location problem
• An exact algorithm for the blocks relocation problem with new lower bounds
• Minimizing the total weighted completion time in the relocation problem
• A tree search procedure for the container relocation problem
• scientific article; zbMATH DE number 1303608

Cited in

(5)

• An adaptive large neighborhood search for relocating vehicles in electric carsharing services
• Carrying umbrellas: An online relocation game on a graph
• On the online min-wait relocation problem
• scientific article; zbMATH DE number 1522930 (Why is no real title available?)
• A linear program for points of interest relocation in adaptive maps

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: A Fast Greedy Algorithm for the Relocation Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807030)