biobjective programming
Recently Published Documents


TOTAL DOCUMENTS

7
(FIVE YEARS 1)

H-INDEX

2
(FIVE YEARS 0)

2021 ◽  
Vol 2021 ◽  
pp. 1-16
Author(s):  
Fang Zhang ◽  
Jian Lu ◽  
Xiaojian Hu

As an interesting research topic in transportation field, tradable credit scheme (TCS) has been extensively explored in the latest decade. Existing studies implicitly assumed that travelers are clear about the equilibrium credit price and make their trips accordingly. However, this may not be the case in reality, since the credit price is endogenously determined by the credit-trading behavior, especially in the early stages after the implementation of a TCS. Considering travelers’ uncertainty on the equilibrium credit price, this paper aims to investigate the impacts of perception error on credit price and how to accommodate such errors by an appropriate scheme design. Transferring the perception error on credit price to a given and fixed value released by central authority, we first investigate the impacts of recommended credit price under a given TCS. The numerical results imply that it is necessary to simultaneously consider the choice of recommended credit price and charging scheme in TCS design. Regarding this, we combine the goals of social welfare and public acceptance of the scheme and propose a bilevel biobjective programming (BLBOP) model, by which the net economic benefit is maximized while the gap between the recommended and realized credit prices is minimized. Through two numerical examples, it is found that the rise in perception variance could intensify the contradiction effect between the two objectives. Additionally, a nonnegligible price gap must be allowed to occur to maintain the effectiveness of a TCS.



2020 ◽  
Vol 2020 ◽  
pp. 1-10 ◽  
Author(s):  
Lan Xu ◽  
Yiliu Tu ◽  
Yuting Zhang

A framework for the algorithm-based CL platform is established, based on which, the operational mode of it is described in detail. An integrated logistics task assignment model is built to optimally match logistics service resources and task of large scale in the algorithm-based CL. Particularly, an improved grasshopper optimization-based bitarget optimization algorithm (GROBO) is proposed to solve the biobjective programming model for service matching in CL. The case of Linyi small commodity logistics is taken as an application. Simulation results show that the proposed GROBO provides better solutions regarding to searching efficiency and stability in solving the model.



2017 ◽  
Vol 2017 ◽  
pp. 1-14 ◽  
Author(s):  
Tao Zhang ◽  
Zhong Chen ◽  
June Liu ◽  
Xiong Li

A two-stage artificial neural network (ANN) based on scalarization method is proposed for bilevel biobjective programming problem (BLBOP). The induced set of the BLBOP is firstly expressed as the set of minimal solutions of a biobjective optimization problem by using scalar approach, and then the whole efficient set of the BLBOP is derived by the proposed two-stage ANN for exploring the induced set. In order to illustrate the proposed method, seven numerical examples are tested and compared with results in the classical literature. Finally, a practical problem is solved by the proposed algorithm.



2011 ◽  
Vol 51 (3) ◽  
pp. 1173-1210 ◽  
Author(s):  
Stacey L. Faulkenberg ◽  
Margaret M. Wiecek


Sign in / Sign up

Export Citation Format

Share Document