Results 161 to 170 of about 1,705 (196)
Some of the next articles are maybe not open access.
Matheuristics for the capacitated p‐median problem
International Transactions in Operational Research, 2014AbstractThe improvement in the performance of computers and mathematical programming techniques has led to the development of a new class of algorithms called matheuristics. Associated with an improvement of Mixed Integer Programming (MIP) solvers, these methods have successfully solved plenty of combinatorial optimization problems. This paper presents
Fernando Stefanello +2 more
openaire +1 more source
A Matheuristic for the Dial-a-Ride Problem
2011The Dial-a-Ride is a transport system on demand. A fleet of vehicles, without fixed routes and schedules, carries people from their pickup points to their delivery points, during a pre-specified time interval. It can be modeled as an N P-hard routing and scheduling problem, with a suitable mixed integer programming formulation. Exact approaches to this
Roberto Wolfler Calvo +1 more
openaire +1 more source
A Matheuristic Algorithm for the Inventory Routing Problem
Transportation Science, 2020This work addresses a challenging inventory routing problem that arises from a practical application faced by air-product companies, including Air Liquide. Given its computational complexity and industrial importance, this problem (denoted as IRP-Challenge2016) was presented as the topic of the French Operational Research and Decision Support Society ...
Zhouxing Su +4 more
openaire +1 more source
Fuzzy Gaussian matheuristics for aggregate production planning with fuzzy stochastic demand
Journal of Industrial and Production EngineeringThe primary contribution of this work is an effective approach for handling fuzzy stochastic demand in aggregate production planning. Managing both randomness and fuzziness in large-scale production planning within reasonable timeframes is challenging ...
H. Hoang, V. Nguyen
semanticscholar +1 more source
A study on the pickup and delivery problem with time windows: Matheuristics and new instances
Computers & Operations Research, 2020In the present work, we study the Pickup and Delivery Problem with Time Windows, which generalizes the well-known Vehicle Routing Problem and has many potential applications to transportation services.
Carlo S. Sartori, L. Buriol
semanticscholar +1 more source
POPMUSIC as a matheuristic for the berth allocation problem
Annals of Mathematics and Artificial Intelligence, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Eduardo Lalla-Ruiz, Stefan Voß 0001
openaire +3 more sources
A Matheuristic for the Drilling Rig Routing Problem
2020In this paper, we discuss the real-world Split Delivery Vehicle Routing Problem with Time Windows (SDVRPTW) for drilling rig routing in Siberia and the Far East. There is a set of objects (exploration sites) requiring well-drilling work. Each object includes a known number of planned wells and needs to be served within a given time interval.
Igor Kulachenko, Polina A. Kononova
openaire +1 more source
A Matheuristic to Solve a Competitive Location Problem
20180 ...
Dolores-Rosa Santos-Peñate +2 more
openaire +2 more sources
An Efficient Matheuristic for the Inventory Routing Problem
2020We consider the general multi-vehicle and multi-period Inventory Routing Problem (IRP). A challenging aspect of solving IRPs is how to capture the relationship among the periods where the routing takes place. Once the routes are defined, computing the optimal inventory at each customer on each period amounts to solving a network flow problem.
Pedro Diniz +2 more
openaire +1 more source