Mark Poon
Mark Poon has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
Ruixue Gu
3 shared publications- Zhenzhen Zhang
School of Economics and Management, Tongji University, Shanghai 200092, China
2 shared publications Zhong Liu
2 shared publicationsAndrew Lim
1 shared publicationJiachen Wei
1 shared publication- Jingyi Zhao1 shared publication
Latest Publications
- 17 August 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 172
A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions
- 17 August 2024
- Published by Elsevier in Computers & Operations Research
- Vol. 172
A branch-and-cut algorithm for the time-dependent vehicle routing problem with time windows and combinatorial auctions
- Top Cited Papers
- 6 September 2022
- Published by Elsevier in Computers & Operations Research
- Vol. 148
A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips
- 6 September 2022
- Published by Elsevier in Computers & Operations Research
- Vol. 148
Top Cited PapersA last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips
- 19 July 2022
- Published by Elsevier in Computers & Operations Research
- Vol. 147
Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
- 19 July 2022
- Published by Elsevier in Computers & Operations Research
- Vol. 147
Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
- Open Access
- 10 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 49757-49770
A Vehicle Routing Problem With Option for Outsourcing and Time-Dependent Travel Time
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).
- 10 May 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 10, 49757-49770
Open AccessA Vehicle Routing Problem With Option for Outsourcing and Time-Dependent Travel Time
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).