کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
382343 660757 2016 14 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The customer-centric, multi-commodity vehicle routing problem with split delivery
ترجمه فارسی عنوان
مشکل مسیریابی وسایل نقلیه چند کالایی مشتری محور با تحویل تقسیم شده
کلمات کلیدی
مشکل حداقل سازی تاخیر؛ مشکل تعمیرکار تحویلی؛ تحویل تقسیم. مسیریابی؛ فراابتکاری
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر هوش مصنوعی
چکیده انگلیسی


• We introduce the Customer-centric, Multi-commodity Vehicle Routing Problem with Split Delivery.
• We propose two mathematical models of the problem and compare.
• Several optimality conditions are proved.
• A hybrid metaheuristic is proposed and used to solve large scale problems.

In this paper, we present the Customer-centric, Multi-commodity Vehicle Routing Problem with Split Delivery (CMVRPSD) whose objective is to minimize total waiting time of customers in distributing multiple types of commodities by multiple capacitated vehicles. It is assumed that a customer's demand can be fulfilled by more than one vehicle. Two classes of decisions are involved in this problem: routing vehicles to customers and quantifying commodities to load and unload. The CMVRPSD can be applied to distributing commodities in customer-oriented distribution problems for both peacetime and disaster situations. The problem is formulated in two Mixed-Integer Linear Programming (MILP) models, and a heuristic method is proposed by adapting and synthesizing Simulated Annealing (SA) and Variable Neighborhood Search (VNS) for large-scale problems. Experimental results show that the proposed hybrid algorithm outperforms other applicable algorithms such as SA, VNS, and Nearest Neighborhood heuristic.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Expert Systems with Applications - Volume 56, 1 September 2016, Pages 335–348
نویسندگان
, ,