Multiple depot vehicle routing problem with split delivery
© 2019, Computers and Industrial Engineering. All rights reserved. In this paper we present a modified mathematical model for the multiple depot vehicle routing problem with split delivery (MDSDVRP). We also present an algorithm for clustering and solving the model. Each cluster includes customers w...
Saved in:
Main Authors: | , |
---|---|
Format: | Conference Proceeding |
Published: |
2020
|
Subjects: | |
Online Access: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85079505595&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/67759 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Chiang Mai University |
id |
th-cmuir.6653943832-67759 |
---|---|
record_format |
dspace |
spelling |
th-cmuir.6653943832-677592020-04-02T15:06:24Z Multiple depot vehicle routing problem with split delivery Pitchaya Pongmanawut Chulin Likasiri Computer Science Engineering © 2019, Computers and Industrial Engineering. All rights reserved. In this paper we present a modified mathematical model for the multiple depot vehicle routing problem with split delivery (MDSDVRP). We also present an algorithm for clustering and solving the model. Each cluster includes customers who have the smallest total distance to its depot and is solved under the condition that a customer can be visited by multiple vehicles. Computational experiments are carried out on 15 benchmark instances that have 50-360 customers and are taken from six related works that proposed different heuristics for solving MDVRP. The aim is to test the effectiveness of split delivery in MDVRP by comparing our results with existing best solutions from all six authors. Our approach is able to improve the solution of 9 instances including 5 better solutions compared with the latest work and 4 best solutions. 2020-04-02T15:02:56Z 2020-04-02T15:02:56Z 2019-01-01 Conference Proceeding 21648689 2-s2.0-85079505595 https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85079505595&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/67759 |
institution |
Chiang Mai University |
building |
Chiang Mai University Library |
country |
Thailand |
collection |
CMU Intellectual Repository |
topic |
Computer Science Engineering |
spellingShingle |
Computer Science Engineering Pitchaya Pongmanawut Chulin Likasiri Multiple depot vehicle routing problem with split delivery |
description |
© 2019, Computers and Industrial Engineering. All rights reserved. In this paper we present a modified mathematical model for the multiple depot vehicle routing problem with split delivery (MDSDVRP). We also present an algorithm for clustering and solving the model. Each cluster includes customers who have the smallest total distance to its depot and is solved under the condition that a customer can be visited by multiple vehicles. Computational experiments are carried out on 15 benchmark instances that have 50-360 customers and are taken from six related works that proposed different heuristics for solving MDVRP. The aim is to test the effectiveness of split delivery in MDVRP by comparing our results with existing best solutions from all six authors. Our approach is able to improve the solution of 9 instances including 5 better solutions compared with the latest work and 4 best solutions. |
format |
Conference Proceeding |
author |
Pitchaya Pongmanawut Chulin Likasiri |
author_facet |
Pitchaya Pongmanawut Chulin Likasiri |
author_sort |
Pitchaya Pongmanawut |
title |
Multiple depot vehicle routing problem with split delivery |
title_short |
Multiple depot vehicle routing problem with split delivery |
title_full |
Multiple depot vehicle routing problem with split delivery |
title_fullStr |
Multiple depot vehicle routing problem with split delivery |
title_full_unstemmed |
Multiple depot vehicle routing problem with split delivery |
title_sort |
multiple depot vehicle routing problem with split delivery |
publishDate |
2020 |
url |
https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85079505595&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/67759 |
_version_ |
1681426694542458880 |