Results 141 to 150 of about 1,705 (196)

Matheuristic variants of DSATUR for the vertex coloring problem

If DSATUR heuristic was proven efficient for many instances of the vertex coloring problem, this paper aims to analyze inefficiency causes of DSATUR heuristic, extending DSATUR with matheuristic operators.
Dupin, Nicolas
core  

A bi-criterion sequence-dependent scheduling problem with order deliveries. [PDF]

PeerJ Comput Sci
Xu JY, Lin WC, Hu KX, Chang YW, Wu WH, Hsu PH, Wu TH, Wu CC.   +7 more
europepmc   +1 more source

A set-covering based heuristic algorithm for the periodic vehicle routing problem.

Discrete Appl Math, 2014
Cacchiani V, Hemmelmayr VC, Tricoire F.
europepmc   +1 more source

Matheuristics to optimize refueling and maintenance planning of nuclear power plants

J. Heuristics, 2018
N. Dupin, El-Ghazali Talbi
semanticscholar   +1 more source

Hybrid column generation and large neighborhood search for the dial-a-ride problem.

Comput Oper Res, 2013
Parragh SN, Schmid V.
europepmc   +1 more source

Matheuristics for slot planning of container vessel bays [PDF]

European Journal of Operational Research, 2020
Stowage planning is an NP-hard combinatorial problem concerned with loading a container vessel in a given port, such that a number of constraints regarding the physical layout of the vessel and its seaworthiness are satisfied, and a number of objectives ...
Berit Dangaard Brouer, Rune Møller Jensen   +1 more
exaly   +6 more sources

Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem

Networks, 2022
For the classical unsplit and split delivery capacitated vehicle routing problems, we carry out a worst‐case analysis for classes of matheuristics and compare their performance on average, on a large set of benchmark instances.
Luca Bertazzi, Xingyin Wang
exaly   +3 more sources

Matheuristics

EURO Advanced Tutorials on Operational Research, 2021
info:eu-repo/semantics ...
V. Maniezzo, Marco A. Boschetti, Thomas Stützle   +2 more
semanticscholar   +5 more sources

A Matheuristics for the Configuration of Automated Vertical Lift Modules Warehouses [PDF]

IEEE Transactions on Automation Science and Engineering
The design of the layout of Vertical Lift Module (VLM) warehouses is a non-trivial process that involves selecting dimensions, internal configuration, and allocation of each tray to avoid space loss while satisfying logistic constraints. Our contribution
Giulia Tresca, G. Cavone, Paolo Scarabaggio, Raffaele Carli, M. Dotoli   +4 more
semanticscholar   +2 more sources

Matheuristics based on iterative linear programming and slope scaling for multicommodity capacitated fixed charge network design

European Journal of Operational Research, 2018
We present new matheuristics for the multicommodity capacitated fixed-charge network design problem (MCND). The matheuristics are based on combining iterative linear programming (ILP) methods and slope scaling (SS) heuristics.
B. Gendron, S. Hanafi, R. Todosijević
semanticscholar   +2 more sources