Results 11 to 20 of about 76,469 (342)

Branch-And-Price Algorithm for the Tramp Ship Routing and Scheduling Problem Considering Ship Speed and Payload

open access: yesJournal 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
semanticscholar   +3 more sources

Assigning lifetime occupation domains for older Mexicans: MHAS-O*NET linkage protocol

open access: yesSalud Pública de México, 2023
Objective. We developed a MHAS (Mexican Health and Aging Study) and O*NET (Occupational Information Network) linkage to allow global researchers using MHAS data to assign lifetime occupation domains for older Mexicans. Materials and methods.
Chih-Ying Li   +6 more
doaj   +1 more source

A Three-Stage Optimization Method for Assembly Line Balancing Problem

open access: yesIEEE Access, 2020
Considering the characteristics of multimodels production pattern on assembly line, the assembly line balancing problem which is non-deterministic polynomial hard becomes more challenging to complete. In this article, we propose a reformulation of simple
Qidong Yin, Xiaochuan Luo
doaj   +1 more source

A Branch-and-Price Algorithm for the Online Scheduling of Valet Drivers

open access: yesAlgorithms, 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 the electric autonomous Dial-A-Ride Problem [PDF]

open access: yesTransportation Research Part B: Methodological, 2022
The Electric Autonomous Dial-A-Ride Problem (E-ADARP) consists in scheduling a fleet of electric autonomous vehicles to provide ride-sharing services for customers that specify their origins and destinations.
Yue Su   +3 more
semanticscholar   +1 more source

A branch-and-price algorithm for the robust single-source capacitated facility location problem under demand uncertainty

open access: yesEURO Journal on Transportation and Logistics, 2022
We consider the robust single-source capacitated facility location problem with uncertainty in customer demands. A cardinality-constrained uncertainty set is assumed for the robust problem.
Jaehyeon Ryu, Sungsoo Park
doaj   +1 more source

A branch‐and‐price algorithm for a targeting problem [PDF]

open access: yesNaval Research Logistics (NRL), 2007
AbstractIn this paper, we consider a new weapon‐target allocation problem with the objective of minimizing the overall firing cost. The problem is formulated as a nonlinear integer programming model, but it can be transformed into a linear integer programming model.
Kwon, O   +3 more
openaire   +2 more sources

A Branch and Price Algorithm for the Heterogeneous Fleet Multi-Depot Multi-Trip Vehicle Routing Problem with Time Windows

open access: yesTransportation Science, 2022
The multi-trip vehicle routing problem (MTVRP) extends the well-known VRP by allowing vehicles to perform several trips in a workday. The motivation arises from the new challenges in city logistics that push companies to use smaller and cleaner vehicles ...
Munise Kübra Sahin, H. Yaman
semanticscholar   +1 more source

Branching in branch-and-price: a generic scheme [PDF]

open access: yesMathematical Programming, 2010
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Degree of monopoly and market power vs. price flexibility in Polish economy: empirical analysis based on COICOP classification

open access: yesOeconomia Copernicana, 2020
Research background: The issue of price flexibility is crucial in the economy both in the aspect of company theory and its macroeconomic consequences. In a number of publications, the sources of variable price flexibility are linked to the market power ...
Paweł Umiński
doaj   +1 more source

Home - About - Disclaimer - Privacy