Single-Sink Multicommodity Flow with Side Constraints

2008 ◽  
pp. 429-450 ◽  
Author(s):  
F. Bruce Shepherd
Keyword(s):  
Multicommodity Flow ◽  
Side Constraints

Autonomy, Side-constraints and Property

Mind ◽  
1979 ◽  
Vol LXXXVIII (1) ◽  
pp. 263-265
Author(s):  
D. R. KNOWLES
Keyword(s):  
Side Constraints

scholarly journals Modeling the Multicommodity Multimodal Routing Problem with Schedule-Based Services and Carbon Dioxide Emission Costs

2015 ◽  
Vol 2015 ◽  
pp. 1-21 ◽  
Author(s):  
Yan Sun ◽  
Maoxiang Lang
Keyword(s):  
Carbon Dioxide ◽  
Carbon Dioxide Emissions ◽  
Transportation Network ◽  
Linearization Method ◽  
Mixed Integer ◽  
Multicommodity Flow ◽  
Routing Problem ◽  
Multimodal Transportation ◽  
Proposed Model ◽  
Freight Routing

We explore a freight routing problem wherein the aim is to assign optimal routes to move commodities through a multimodal transportation network. This problem belongs to the operational level of service network planning. The following formulation characteristics will be comprehensively considered: (1) multicommodity flow routing; (2) a capacitated multimodal transportation network with schedule-based rail services and time-flexible road services; (3) carbon dioxide emissions consideration; and (4) a generalized costs optimum oriented to customer demands. The specific planning of freight routing is thus defined as a capacitated time-sensitive multicommodity multimodal generalized shortest path problem. To solve this problem systematically, we first establish a node-arc-based mixed integer nonlinear programming model that combines the above formulation characteristics in a comprehensive manner. Then, we develop a linearization method to transform the proposed model into a linear one. Finally, a computational experiment from the Chinese inland container export business is presented to demonstrate the feasibility of the model and linearization method. The computational results indicate that implementing the proposed model and linearization method in the mathematical programming software Lingo can effectively solve the large-scale practical multicommodity multimodal transportation routing problem.

A New Resource-Constrained Multicommodity Flow Model for Conflict-Free Train Routing and Scheduling

2011 ◽  
Vol 45 (2) ◽  
pp. 212-227 ◽  
Author(s):  
G. Caimi ◽  
F. Chudak ◽  
M. Fuchsberger ◽  
M. Laumanns ◽  
R. Zenklusen
Keyword(s):  
Flow Model ◽  
Multicommodity Flow ◽  
Resource Constrained ◽  
Routing And Scheduling ◽  
Train Routing

All-or-Nothing Multicommodity Flow Problem with Bounded Fractionality in Planar Graphs

2018 ◽  
Vol 47 (4) ◽  
pp. 1483-1504 ◽  
Author(s):  
Ken-ichi Kawarabayashi ◽  
Yusuke Kobayashi
Keyword(s):  
Planar Graphs ◽  
Flow Problem ◽  
Multicommodity Flow ◽  
Multicommodity Flow Problem
Sign in / Sign up

Export Citation Format

Share Document