Results 1 to 10 of about 451,802 (301)

Column generation for extended formulations [PDF]

open access: yesEURO Journal on Computational Optimization, 2013
Working in an extended variable space allows one to develop tighter reformulations for mixed integer programs. However, the size of the extended formulation grows rapidly too large for a direct treatment by a MIP-solver.
Ruslan Sadykov, François Vanderbeck
doaj   +7 more sources

A hybrid VNS matheuristic for a bin packing problem with a color constraint [PDF]

open access: yesYugoslav Journal of Operations Research, 2021
We study a new variant of the bin packing problem with a color constraint. Given a finite set of items, each item has a set of colors. Each bin has a color capacity, the total number of colors for a bin is the unification of colors for its items and ...
Kochetov Yury, Kondakov Arteam
doaj   +1 more source

Matheuristics and Column Generation for a Basic Technician Routing Problem

open access: yesAlgorithms, 2021
This paper considers a variant of the Vehicle Routing Problem with Time Windows, with site dependencies, multiple depots and outsourcing costs. This problem is the basis for many technician routing problems.
Nicolas Dupin   +2 more
doaj   +1 more source

Branch and Price Algorithm for Multi-Trip Vehicle Routing with a Variable Number of Wagons and Time Windows

open access: yesAlgorithms, 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

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

open access: yesAlgorithms, 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   +1 more
doaj   +1 more source

ONE-DIMENSIONAL CUTTING STOCK PROBLEM THAT MINIMIZES THE NUMBER OF DIFFERENT PATTERNS

open access: yesBarekeng, 2022
Cutting stock problem (CSP) is a problem of cutting an object into several smaller objects to fulfill the existing demand with a minimum unused object remaining.
Bib Paruhum Silalahi   +3 more
doaj   +1 more source

High-Speed Railway EMUs’ Circulation Plan Optimization: A Two-Stage Optimization Algorithm Based on Column Generation

open access: yesIEEE Access, 2020
Considering the characteristics of China's high-speed railway network and the allocation structure of Electric Multiple Units (EMUs), the EMUs operation management mode provides an effective technical route for EMUs route planning optimization. To reduce
Wen-Jun Li   +4 more
doaj   +1 more source

A Column-Generation Based Approach for Integrating Surgeon and Surgery Scheduling

open access: yesIEEE Access, 2018
This paper addresses the operating room management problem for private hospitals aimed at the high-end customer market. A patient preference-driven policy that incorporates surgeon scheduling into the surgery scheduling process is proposed to satisfy ...
Yu Wang   +4 more
doaj   +1 more source

The operational flight and multi-crew scheduling problem [PDF]

open access: yesYugoslav Journal of Operations Research, 2005
This paper introduces a new kind of operational multi-crew scheduling problem which consists in simultaneously modifying, as necessary, the existing flight departure times and planned individual work days (duties) for the set of crew members, while ...
Stojković Mirela, Soumis François
doaj   +1 more source

The Column Generatiion and Traiin Crew Scheduliing

open access: yesCommunications, 2016
Better productivity and efficiency is more and more required in the railway operation. The train crew management is one of the several problems that could be solved using mathematical methods. Crew management is a problem that is well-known in Operations
Jaroslav Janacek   +2 more
doaj   +1 more source

Home - About - Disclaimer - Privacy