Results 21 to 30 of about 1,705 (196)

Matheuristics for Inventory Routing Problems

, 2011
In this chapter the authors review the main heuristic approaches for the solution of inventory routing problems and present the most recent and interesting ideas for the design of a new class of heuristics, that they call matheuristics. A matheuristic embeds, in a heuristic or metaheuristic scheme, the exact solution of one or several mathematical ...
BERTAZZI, Luca, SPERANZA, Maria Grazia
openaire   +3 more sources

Special issue on matheuristics [PDF]

Journal of Heuristics, 2021
Y. Kergosien, J. Mendoza, V. T’kindt
semanticscholar   +2 more sources

Parallel matheuristics for the discrete unit commitment problem with min-stop ramping constraints

International Transactions in Operational Research, 2020
International audienceThe discrete unit commitment problem with min‐stop ramping constraints optimizes the daily production of thermal power plants, subject to an operational reactivity of thermal units in a 30‐minute delay.
N. Dupin, El-Ghazali Talbi
semanticscholar   +2 more sources

A Decision-Making Tool for Algorithm Selection Based on a Fuzzy TOPSIS Approach to Solve Replenishment, Production and Distribution Planning Problems

Mathematics, 2022
A wide variety of methods and techniques with multiple characteristics are used in solving replenishment, production and distribution planning problems.
Eduardo Guzman, Beatriz Andres, Raul Poler   +2 more
doaj   +1 more source

New variable neighbourhood search based 0-1 MIP heuristics [PDF]

Yugoslav Journal of Operations Research, 2015
In recent years many so-called matheuristics have been proposed for solving Mixed Integer Programming (MIP) problems. Though most of them are very efficient, they do not all theoretically converge to an optimal solution. In this paper we suggest
Hanafi Saïd, Lazić Jasmina, Mladenović Nenad, Wilbaut Christophe, Crévits Igor   +4 more
doaj   +1 more source

Special issue on “Matheuristics” [PDF]

International Transactions in Operational Research, 2016
info:eu-repo/semantics ...
Thomas Stützle, Vittorio Maniezzo
openaire   +4 more sources

Efficient Mathematical Lower Bounds for City Logistics Distribution Network with Intra-Echelon Connection of Facilities: Bridging the Gap from Theoretical Model Formulations to Practical Solutions

Algorithms, 2023
Focusing on the dynamic improvement of the underlying service network configuration, this paper aims to address a specific challenge of redesigning a multi-echelon city logistics distribution network.
Zhiqiang Niu, Shengnan Wu, Xuesong (Simon) Zhou   +2 more
doaj   +1 more source

Hybrid matheuristics to solve the integrated lot sizing and scheduling problem on parallel machines with sequence-dependent and non-triangular setup [PDF]

European Journal of Operational Research, 2021
This paper approaches the integrated lot sizing and scheduling problem (ILSSP), in which non-identical machines work in parallel with non-triangular sequence-dependent setup costs and times, setup carry-over and capacity limitation.
D. Carvalho, M. C. Nascimento
semanticscholar   +1 more source

Kernel Search for the Capacitated Vehicle Routing Problem

Applied Sciences, 2022
This paper addresses the Capacitated Vehicle Routing Problem (CVRP), which is a widely studied optimization problem due to its relevance to the field of transportation, distribution, and logistics.
Zuzana Borčinová
doaj   +1 more source

Computational Performance Evaluation of Column Generation and Generate-and-Solve Techniques for the One-Dimensional Cutting Stock Problem

Algorithms, 2022
The Cutting Stock Problem (CSP) is an optimisation problem that roughly consists of cutting large objects in order to produce small items. The computational effort for solving this problem is largely affected by the number of cutting patterns.
José Victor Sá Santos, Napoleão Nepomuceno   +1 more
doaj   +1 more source