Optimization of vehicle routing with pickup based on multibatch production
type: Item
instance of: scholarly article
title: Optimization of vehicle routing with pickup based on multibatch production
zbMATH Open document ID: 1417.90024
DOI: 10.1155/2018/2804589
author: Hongtao Hu
author: Jiao Mo
author: Chengle Ma
author: Xinchang Wang
published in: Discrete Dynamics in Nature and Society
publication date: 2019-02-20T00:00:00Z
review text: Summary: To reduce the inventory cost and ensure product quality while meeting the diverse demands of customers, manufacturers yield products in batches. However, the raw materials required for manufacturing need to be obtained from suppliers in advance, making it necessary to understand beforehand how to best structure the pickup routes so as to reduce the cost of picking up and stocking while also ensuring the supply of raw materials required for each batch of production. To reduce the transportation and inventory costs, therefore, this paper establishes a mixed integer programming model for the joint optimization of multibatch production and vehicle routing problems involving a pickup. Following this, a two-stage hybrid heuristic algorithm is proposed to solve this model. In the first stage, an integrated algorithm, combining the Clarke-Wright (CW) algorithm and the Record to Record (RTR) travel algorithm, was used to solve vehicle routing problem. In the second stage, the Particle Swarm Optimization (PSO) algorithm was used to allocate vehicles to each production batch. Multiple sets of numerical experiments were then performed to validate the effectiveness of the proposed model and the performance efficiency of the two-stage hybrid heuristic algorithm.
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B05
zbMATH DE Number: 7026535
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2018/2804589
OpenAlex ID: W2899087868
cites work: The truck dispatching problem
cites work: Robust branch-and-cut-and-price for the capacitated vehicle routing problem
cites work: A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources
cites work: The General Pickup and Delivery Problem
cites work: Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries
cites work: A tabu search procedure for coordinating production, inventory and distribution routing problems
cites work: Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
cites work: The warehouse-inventory-transportation problem for supply chains
cites work: New optimization heuristics. The great deluge algorithm and the record- to-record travel
cites work: Very large-scale vehicle routing: new test problems, algorithms, and results
Recommended article: Pickup and Delivery Vehicle Routing with Multidimensional Loading Constraints
Recommended article: The vehicle routing problem with simultaneous pickup and delivery and handling costs
Recommended article: The multi-vehicle profitable pickup and delivery problem
Recommended article: Optimizing routing and delivery patterns with multi-compartment vehicles
Recommended article: Optimally solving the joint order batching and picker routing problem
Recommended article: Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem
Recommended article: Q4687994
Recommended article: Multi-objective vehicle routing problems
description: scientific article; zbMATH DE number 7026535