An active-learning Pareto evolutionary algorithm for parcel locker network design considering accessibility of customers

DOI10.1016/j.cor.2021.105677OpenAlexW4205648735MaRDI QIDQ2669739

Rongjuan Luo, Shoufeng Ji, Yuan-yuan Ji

Publication date: 9 March 2022

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2021.105677

zbMATH Keywords

accessibilitymulti-objective optimizationactive learningparcel locker network designurban last-mile logistics

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Uses Software

• MOEA/D

Cites Work

• Local search heuristics for the mobile facility location problem
• Same-day delivery with pickup stations and autonomous vehicles
• Data-driven distributionally robust capacitated facility location problem
• Optimizing the changing locations of mobile parcel lockers in last-mile distribution
• The two-echelon vehicle routing problem with covering options: city logistics with cargo bikes and parcel lockers
• The incremental connected facility location problem
• Dynamic Assortment Optimization with a Multinomial Logit Choice Model and Capacity Constraint
• Health service network design: a robust possibilistic approach
• Random Choice as Behavioral Optimization
• Capacitated facility location/network design problems.

This page was built for publication: An active-learning Pareto evolutionary algorithm for parcel locker network design considering accessibility of customers