A Bi-level Programming to Two-Stage Transportation Planning Problem

Author(s):  
Cuiying Feng ◽  
Ling Nie
2021 ◽  
Vol 233 ◽  
pp. 108004
Author(s):  
Maria João Santos ◽  
Eduardo Curcio ◽  
Pedro Amorim ◽  
Margarida Carvalho ◽  
Alexandra Marques

Mathematics ◽  
2020 ◽  
Vol 8 (10) ◽  
pp. 1788
Author(s):  
Yanjun Shi ◽  
Na Lin ◽  
Qiaomei Han ◽  
Tongliang Zhang ◽  
Weiming Shen

This paper addresses a collaborative multi-carrier vehicle routing problem (CMCVRP) where carriers tackle their orders collaboratively to reduce transportation costs. First, a hierarchical heuristics algorithm is proposed to solve the transportation planning problem. This algorithm makes order assignments based on two distance rules and solves the vehicle routing problem with a hybrid genetic algorithm. Second, the profit arising from the coalition is quantified, and an improved Shapley value method is proposed to distribute the profit fairly to individual players. Extensive experiment results showed the effectiveness of the proposed hierarchical heuristics algorithm and confirmed the stability and fairness of the improved Shapley value method.


2014 ◽  
Vol 989-994 ◽  
pp. 1526-1531
Author(s):  
Yan Yi Chen ◽  
Tie Xin Liu

Applying transportation planning theory and operations research method , this paper proposes the layout model of integrated freight hub with two-stage , which first builds a model to predict the attributes of integrated freight hub aiming for the optimization of regional freight transportation organization , and then works out the way to classify district integrated freight hub based on Hierarchical cluster. Eventually, take a specific example for empirical study.


Sign in / Sign up

Export Citation Format

Share Document