Results 11 to 20 of about 124,219 (294)
A branch-and-price algorithm for the temporal bin packing problem
Computers & Operations Research, 2020 We study an extension of the classical Bin Packing Problem, where each item consumes the bin capacity during a given time window that depends on the item itself. The problem asks for finding the minimum number of bins to pack all the items while respecting the bin capacity at any time instant.
Dell'Amico M., Furini F., Iori M.
openaire +9 more sources
A Branch-and-Price Algorithm for the Online Scheduling of Valet Drivers
Algorithms, 2023 In the present paper, the online valet driving problem (OVDP) is studied. In this problem, customers request a valet driving service through the platform, then the valets arrive on e-bikes at the designated pickup location and drive the vehicle to the ...
Lei Zhang, Zhi Pei
doaj +1 more source
A branch-and-price algorithm for two-echelon electric vehicle routing problem
Complex & Intelligent Systems, 2021 Motivated by express and e-commerce companies’ distribution practices, we study a two-echelon electric vehicle routing problem. In this problem, fuel-powered vehicles are used to transport goods from a depot to intermediate facilities (satellites) in the
Zhiguo Wu, Juliang Zhang
doaj +1 more source
Journal of Marine Science and Engineering, 2022 In recent years, increasing fuel prices, depressed market conditions and air pollution issues have brought huge challenges to the tramp shipping industry.
Lingzi Li +4 more
doaj +1 more source
Quantity decisions of two-stage competitive location model based on different location modes
Complex & Intelligent Systems, 2021 The facility location of a competing firm in a market has great importance in supply chain management. The two-stage competitive location model formulates the decision process of an entrant firm facing both location and price competition.
Yadong Li, Xuemei Li
doaj +1 more source
Algorithms, 2022 Motivated by the transportation needs of modern-day retailers, we consider a variant of the vehicle routing problem with time windows in which each truck has a variable capacity. In our model, each vehicle can bring one or more wagons.
Leila Karimi, Chowdhury Nawrin Ferdous
doaj +1 more source
Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm [PDF]
INFORMS Journal on Computing, 2013 The bin packing problem with conflicts consists of packing items in a minimum number of bins of limited capacity while avoiding joint assignments of items that are in conflict. Our study demonstrates that a generic implementation of a branch-and-price algorithm using specific pricing oracle yields comparatively good performance for this problem.
Sadykov, Ruslan, Vanderbeck, François
openaire +1 more source
A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem [PDF]
Operations Research, 2003 In this paper, we propose a multiperiod single-sourcing problem (MPSSP), which takes both transportation and inventory into consideration, suitable for evaluating the performance of a logistics distribution network in a dynamic environment. We reformulate the MPSSP as a Generalized Assignment Problem (GAP) with a convex objective function.
Richard Freling +3 more
openaire +9 more sources
Circulation of Railway Rolling Stock: A Branch-and-Price Approach [PDF]
, 2003 We describe an algorithmic approach to determine an efficient railway rolling stock circulation on a single line or on a set of interacting lines. Given the timetable and the passengers?
Kroon, L.G. (Leo), Peeters, M. (Marc)
core +10 more sources
Column Generation Algorithm: A revision from its application to the Student Assignation Problem
Revista Facultad de Ingeniería Universidad de Antioquia, 2013 The Column Generation Algorithm (CGA) is commonly cited in the bibliography as alternative to solve large scale optimization problems. This article deals with the description of the GC algorithm in the context of the student assignation to the public ...
Pablo Andrés Maya
doaj +1 more source