Mark Poon

Mark Poon

Auto-generated profile, based on publicly available information

Mark Poon

Department of Logistics and Operations Management, HEC Montral, Montral, QC, Canada

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 September 2022 in Computers & Operations Research
Verified
Journal Article
Closed access
LZLuo Zhihao
Luo Zhihao
RGRuixue Gu
Ruixue Gu
MPMark Poon
Mark Poon
ZLZhong Liu
Zhong Liu
ALAndrew Lim
Andrew Lim

6 June 2022 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
RGRuixue Gu
Ruixue Gu
MPMark Poon
Mark Poon
ZLZhihao Luo
Zhihao Luo
YLYang Liu
Yang Liu
ZLZhong Liu
Zhong Liu

29 August 2022 in Transportation Research Part C: Emerging Technologies
Verified
Journal Article
Closed access
YWYuelin Wu
Yuelin Wu
MPMark Poon
Mark Poon
ZYZhenzhou Yuan
Zhenzhou Yuan
QXQingyu Xiao
Qingyu Xiao

19 July 2022 in Computers & Operations Research
Verified
Journal Article
Closed access
JZJingyi Zhao
Jingyi Zhao
MPMark Poon
Mark Poon
ZZZhenzhen Zhang
Zhenzhen Zhang
RGRuixue Gu
Ruixue Gu

17 August 2024 in Computers & Operations Research
Verified
Journal Article
Closed access
JWJiachen Wei
Jiachen Wei
MPMark Poon
Mark Poon
ZZZhenzhen Zhang
Zhenzhen Zhang

10 May 2022 in IEEE Access
Verified
Journal Article
Open access
MPMark Poon
Mark Poon
RGRuixue Gu
Ruixue Gu
YYYiliang Yuan
Yiliang Yuan
This paper studies the time-dependent vehicle routing problem with private fleet and common carriers (TDVRPPC), which provides an option to outsource the customer requests and considers real-world time-dependent travel times. The problem is commonly seen in the transportation and logistics industries as it considers the impact of changing traffic conditions on travel times, maximum working hour regulations as well as vehicle capacity constraints. The time-dependent travel time is modeled as a piecewise linear function, based on which a mixed integer programming model is proposed for the TDVRPPC. To solve this NP-hard problem, we customize a hybrid algorithm to harness an adaptive large neighborhood search algorithm for exploration and a tabu search for the exploitation of the search. Through constraint relaxation, dynamic and coordinated adjustment of diversification and intensification strengths of the hybridized procedures, as well as an effective segment-based evaluation method, the proposed algorithm performs well on newly generated test instances for the TDVRPPC and on benchmark instances for the simplified vehicle routing problem with private fleet and common carriers (VRPPC).