Search
Search Results
-
Distributed Integral Column Generation for Set Partitioning Problems
Column generation (CG) is widely used to solve industrial optimization problems, namely vehicle and crew scheduling problems. This method becomes...
-
An Efficient Heuristic for the k-Partitioning Problem
We investigate the k-partitioning problem, in which a set of items is divided into mutually exclusive and collectively exhaustive non-empty groups...
-
-
On the use of partitioning for scheduling of surgeries in the inpatient surgical department
In hospitals, the efficient planning of the operating rooms (ORs) is difficult due to the uncertainty inherent to surgical services. This is...
-
A Determining Degree-Based Method for Classification Problems with Interval-Valued Attributes
The determining degree-based classification methods, new types of classification methods built in the frame of factor space theory, mainly include...
-
Location-Inventory Problems
In this chapter, inventory and facility location decisions are intertwined. Different problems, models, and algorithms are discussed. The impact of...
-
Advances in the decision-making of set covering models under uncertainty
The Set Covering Problem (SCP) has been an extensively studied NP-hard problem in the field of combinatorial optimization since 1970. Over the past...
-
Matheuristic fixed set search applied to the multidimensional knapsack problem and the knapsack problem with forfeit sets
In this paper, we present a solution method for the multidimensional knapsack problem (MKP) and the knapsack problem with forfeit sets (KPFS) using a...
-
Waste collection routing: a survey on problems and methods
Waste collection is a vital service performed all over the world, which heavily relies on vehicle routing. Due to regulations and local conditions,...
-
A survey of attended home delivery and service problems with a focus on applications
The research field of attended home delivery (AHD) and attended home service (AHS) problems has experienced fast growing interest in the last two...
-
Preprocessing to Reduce Vehicle Capacity for Routing Problems
We provide a preprocessing method to reduce the vehicle capacity for instances of the capacitated vehicle routing problem. This improves the LP bound...
-
gym-flp: A Python Package for Training Reinforcement Learning Algorithms on Facility Layout Problems
Reinforcement learning (RL) algorithms have proven to be useful tools for combinatorial optimisation. However, they are still underutilised in...
-
Implementing a multi-user framework for vehicle routing problems: a chronicle
We report the design and implementation of a framework for solving general instances of vehicle routing problems, which was implemented within a...
-
Integral column generation for the set partitioning problem
The integral simplex using decomposition (ISUD) algorithm was recently developed to solve efficiently set partitioning problems containing a number...
-
Distance approximation to support customer selection in vehicle routing problems
Estimating the solution value of transportation problems can be useful to assign customers to days for multi-period vehicle routing problems, or to...
-
An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems
This paper presents the problem of batching and scheduling jobs belonging to incompatible job families on unrelated-parallel machines. More...
-
Low-Level Problems
Low-level problems offer an introductory view of modeling in mathematical programming. We work with simple systems where the elements do not offer...
-
Vehicle routing problems over time: a survey
In vehicle routing problems (VRPs) the decisions to be taken concern the assignment of customers to vehicles and the sequencing of the customers...
-
An exact approach for the multi-constraint graph partitioning problem
In this work, a multi-constraint graph partitioning problem is introduced. The input is an undirected graph with costs on the edges and multiple...