earticle

논문검색

Research on Multi-Vehicle Logistics Ridesharing Matching Problem with Space-Time

목차

Abstract
 1. Introduction 
 2. Description of the Problem and Characteristics of Time-Varying Network
  2.1. Problem Description
  2.2. Time Varying Network
 3. MVLRMP-ST Problem Model
  3.1. Problem Formulation
  3.2. The Relaxation of Time Window Constraint
 4. Key Factor of TSCA-ST Algorithm
  4.1. Determination of Time Which Takes to Cross the Section
  4.2. Determination of Vehicle Speed
 5. Numerical Experiment and Result Analysis
  5.1. Fundamental Data of the Experiment
  5.2. Experimental Process and Analysis
 6. Conclusions
 Acknowledgements
 References

저자정보

  • Dong Shuxia School of Information Technology, Shandong Women's University, Jinan, City, Shandong Province, China
  • Shao Zengzhen School of Information Science and Engineering, Shandong Normal University, Jiana City

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.