Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels

DOI10.1142/S0217595922500269zbMATH Open1525.90071MaRDI QIDQ6053530FDOQ6053530

Authors: Song Pu, Chang Xia 

Publication date: 19 October 2023

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Recommendations

• The grey zone two-echelon vehicle routing problem with customer-to-parcel locations and low-pollution vehicles for inner-city logistics
• A truck and drones model for last-mile delivery: a mathematical model and heuristic approach
• Last-mile shared delivery: a discrete sequential packing approach
• A branch-and-price algorithm for location-routing problems with pick-up stations in the last-mile distribution system
• Multi-trip vehicle routing problem with order release time

zbMATH Keywords

vehicle routingbranch-and-pricepickup and delivery problemlabel-setting algorithm

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Cites Work

• The pickup and delivery problem with time windows
• The dial-a-ride problem: Models and algorithms
• Accelerated label setting algorithms for the elementary resource constrained shortest path problem
• New route relaxation and pricing strategies for the vehicle routing problem
• A column generation approach for location-routing problems with pickup and delivery
• An exact algorithm for the pickup and delivery problem with time windows
• A comparison of column-generation approaches to the synchronized pickup and delivery problem
• The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
• A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
• Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers
• A branch-and-price algorithm for the vehicle routing problem with deliveries, selective pickups and time windows
• Dynamic programming algorithms for the elementary shortest path problem with resource constraints
• A branch-and-cut-and-price approach for the pickup and delivery problem with shuttle routes
• New Refinements for the Solution of Vehicle Routing Problems with Branch and Price
• Exact algorithms for the multi-pickup and delivery problem with time windows
• An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
• A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities

Cited In (10)

• Optimizing package express operations in China
• Learn global and optimize local: a data-driven methodology for last-mile routing
• Title not available (Why is that?)
• Title not available (Why is that?)
• Community logistics and dynamic community partitioning: a new approach for solving e-commerce last mile delivery
• Title not available (Why is that?)
• Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs
• How to choose ``last mile delivery modes for E-fulfillment
• Collaboration and evolution of e-commerce and express delivery industry supply chain
• A machine learning optimization approach for last-mile delivery and third-party logistics

This page was built for publication: Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6053530)