Loading…

Hybrid approach for the Multiple Vehicle Routing Problem with Deliveries and Selective Pickups

We propose the Multiple Vehicle Routing Problem with Delivery and Selective Pickups (MVRPDSP) along with a mixed integer linear programming formulation and a hybrid cluster-first heuristic. We show that it is possible to divide the cluster-first heuristic in sub problems which can be solved exactly...

Full description

Saved in:

Bibliographic Details
Main Authors:	Bruck, B. P., dos Santos, Andre Gustavo
Format:	Conference Proceeding
Language:	English
Subjects:	Analysis of variance combinatorial optimization Context Hybrid intelligent systems hybrid methods Mathematical model Routing vehicle routing Vehicles
Online Access:	Request full text
Tags:	Add Tag No Tags, Be the first to tag this record!

cited_by
cites
container_end_page	270
container_issue
container_start_page	265
container_title
container_volume
creator	Bruck, B. P. dos Santos, Andre Gustavo
description	We propose the Multiple Vehicle Routing Problem with Delivery and Selective Pickups (MVRPDSP) along with a mixed integer linear programming formulation and a hybrid cluster-first heuristic. We show that it is possible to divide the cluster-first heuristic in sub problems which can be solved exactly and their solutions combined in a semi-greedy way to generate good solutions. The results show that while the model is not able to find even a feasible solution for several instances the heuristic finds, for most cases, better or equal solutions in a matter of milliseconds, including 4 optimal solutions, what proves its efficiency. We also tested a combined approach, using the heuristic to generate an initial solution for the model, which improved even more the results of the heuristic.
doi_str_mv	10.1109/HIS.2012.6421345
format	conference_proceeding
fullrecord	<record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_6421345</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6421345</ieee_id><sourcerecordid>6421345</sourcerecordid><originalsourceid>FETCH-LOGICAL-i90t-a134a1d2e27d985298a82a8138bfd8279330afa949ad468b29110fff351fb0013</originalsourceid><addsrcrecordid>eNpVUN1LwzAcjIigzL4LvuQfaM1X2-RR5kcHE4cbPjrS5hcb7daSpo799wbci0_HHdxxdwjdUJJRStRdtVhnjFCWFYJRLvIzlKhSUlGUPKc0L8__cUEuUTKOX4SQ6C5YLq_QR3WsvTNYD4PvddNi23scWsAvUxfc0AF-h9Y1Ed_6Kbj9J175vu5ghw8utPgBOvcD3sGI9d7gNXTQhKjglWu-p2G8RhdWdyMkJ5yhzdPjZl6ly9fnxfx-mTpFQqpjd00NA1YaJXOmpJZMS8plbY1kpeKcaKuVUNqIQtZMxf7W2jjK1nEMn6Hbv1gHANvBu532x-3pFP4Lhx5U5A</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Hybrid approach for the Multiple Vehicle Routing Problem with Deliveries and Selective Pickups</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Bruck, B. P. ; dos Santos, Andre Gustavo</creator><creatorcontrib>Bruck, B. P. ; dos Santos, Andre Gustavo</creatorcontrib><description>We propose the Multiple Vehicle Routing Problem with Delivery and Selective Pickups (MVRPDSP) along with a mixed integer linear programming formulation and a hybrid cluster-first heuristic. We show that it is possible to divide the cluster-first heuristic in sub problems which can be solved exactly and their solutions combined in a semi-greedy way to generate good solutions. The results show that while the model is not able to find even a feasible solution for several instances the heuristic finds, for most cases, better or equal solutions in a matter of milliseconds, including 4 optimal solutions, what proves its efficiency. We also tested a combined approach, using the heuristic to generate an initial solution for the model, which improved even more the results of the heuristic.</description><identifier>ISBN: 9781467351140</identifier><identifier>ISBN: 1467351148</identifier><identifier>EISBN: 9781467351157</identifier><identifier>EISBN: 1467351164</identifier><identifier>EISBN: 1467351156</identifier><identifier>EISBN: 9781467351164</identifier><identifier>DOI: 10.1109/HIS.2012.6421345</identifier><language>eng</language><publisher>IEEE</publisher><subject>Analysis of variance ; combinatorial optimization ; Context ; Hybrid intelligent systems ; hybrid methods ; Mathematical model ; Routing ; vehicle routing ; Vehicles</subject><ispartof>2012 12th International Conference on Hybrid Intelligent Systems (HIS), 2012, p.265-270</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6421345$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6421345$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Bruck, B. P.</creatorcontrib><creatorcontrib>dos Santos, Andre Gustavo</creatorcontrib><title>Hybrid approach for the Multiple Vehicle Routing Problem with Deliveries and Selective Pickups</title><title>2012 12th International Conference on Hybrid Intelligent Systems (HIS)</title><addtitle>HIS</addtitle><description>We propose the Multiple Vehicle Routing Problem with Delivery and Selective Pickups (MVRPDSP) along with a mixed integer linear programming formulation and a hybrid cluster-first heuristic. We show that it is possible to divide the cluster-first heuristic in sub problems which can be solved exactly and their solutions combined in a semi-greedy way to generate good solutions. The results show that while the model is not able to find even a feasible solution for several instances the heuristic finds, for most cases, better or equal solutions in a matter of milliseconds, including 4 optimal solutions, what proves its efficiency. We also tested a combined approach, using the heuristic to generate an initial solution for the model, which improved even more the results of the heuristic.</description><subject>Analysis of variance</subject><subject>combinatorial optimization</subject><subject>Context</subject><subject>Hybrid intelligent systems</subject><subject>hybrid methods</subject><subject>Mathematical model</subject><subject>Routing</subject><subject>vehicle routing</subject><subject>Vehicles</subject><isbn>9781467351140</isbn><isbn>1467351148</isbn><isbn>9781467351157</isbn><isbn>1467351164</isbn><isbn>1467351156</isbn><isbn>9781467351164</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2012</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNpVUN1LwzAcjIigzL4LvuQfaM1X2-RR5kcHE4cbPjrS5hcb7daSpo799wbci0_HHdxxdwjdUJJRStRdtVhnjFCWFYJRLvIzlKhSUlGUPKc0L8__cUEuUTKOX4SQ6C5YLq_QR3WsvTNYD4PvddNi23scWsAvUxfc0AF-h9Y1Ed_6Kbj9J175vu5ghw8utPgBOvcD3sGI9d7gNXTQhKjglWu-p2G8RhdWdyMkJ5yhzdPjZl6ly9fnxfx-mTpFQqpjd00NA1YaJXOmpJZMS8plbY1kpeKcaKuVUNqIQtZMxf7W2jjK1nEMn6Hbv1gHANvBu532x-3pFP4Lhx5U5A</recordid><startdate>201212</startdate><enddate>201212</enddate><creator>Bruck, B. P.</creator><creator>dos Santos, Andre Gustavo</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>201212</creationdate><title>Hybrid approach for the Multiple Vehicle Routing Problem with Deliveries and Selective Pickups</title><author>Bruck, B. P. ; dos Santos, Andre Gustavo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i90t-a134a1d2e27d985298a82a8138bfd8279330afa949ad468b29110fff351fb0013</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Analysis of variance</topic><topic>combinatorial optimization</topic><topic>Context</topic><topic>Hybrid intelligent systems</topic><topic>hybrid methods</topic><topic>Mathematical model</topic><topic>Routing</topic><topic>vehicle routing</topic><topic>Vehicles</topic><toplevel>online_resources</toplevel><creatorcontrib>Bruck, B. P.</creatorcontrib><creatorcontrib>dos Santos, Andre Gustavo</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bruck, B. P.</au><au>dos Santos, Andre Gustavo</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Hybrid approach for the Multiple Vehicle Routing Problem with Deliveries and Selective Pickups</atitle><btitle>2012 12th International Conference on Hybrid Intelligent Systems (HIS)</btitle><stitle>HIS</stitle><date>2012-12</date><risdate>2012</risdate><spage>265</spage><epage>270</epage><pages>265-270</pages><isbn>9781467351140</isbn><isbn>1467351148</isbn><eisbn>9781467351157</eisbn><eisbn>1467351164</eisbn><eisbn>1467351156</eisbn><eisbn>9781467351164</eisbn><abstract>We propose the Multiple Vehicle Routing Problem with Delivery and Selective Pickups (MVRPDSP) along with a mixed integer linear programming formulation and a hybrid cluster-first heuristic. We show that it is possible to divide the cluster-first heuristic in sub problems which can be solved exactly and their solutions combined in a semi-greedy way to generate good solutions. The results show that while the model is not able to find even a feasible solution for several instances the heuristic finds, for most cases, better or equal solutions in a matter of milliseconds, including 4 optimal solutions, what proves its efficiency. We also tested a combined approach, using the heuristic to generate an initial solution for the model, which improved even more the results of the heuristic.</abstract><pub>IEEE</pub><doi>10.1109/HIS.2012.6421345</doi><tpages>6</tpages></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISBN: 9781467351140
ispartof	2012 12th International Conference on Hybrid Intelligent Systems (HIS), 2012, p.265-270
issn
language	eng
recordid	cdi_ieee_primary_6421345
source	IEEE Electronic Library (IEL) Conference Proceedings
subjects	Analysis of variance combinatorial optimization Context Hybrid intelligent systems hybrid methods Mathematical model Routing vehicle routing Vehicles
title	Hybrid approach for the Multiple Vehicle Routing Problem with Deliveries and Selective Pickups
url	http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T23%3A52%3A10IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Hybrid%20approach%20for%20the%20Multiple%20Vehicle%20Routing%20Problem%20with%20Deliveries%20and%20Selective%20Pickups&rft.btitle=2012%2012th%20International%20Conference%20on%20Hybrid%20Intelligent%20Systems%20(HIS)&rft.au=Bruck,%20B.%20P.&rft.date=2012-12&rft.spage=265&rft.epage=270&rft.pages=265-270&rft.isbn=9781467351140&rft.isbn_list=1467351148&rft_id=info:doi/10.1109/HIS.2012.6421345&rft.eisbn=9781467351157&rft.eisbn_list=1467351164&rft.eisbn_list=1467351156&rft.eisbn_list=9781467351164&rft_dat=%3Cieee_6IE%3E6421345%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i90t-a134a1d2e27d985298a82a8138bfd8279330afa949ad468b29110fff351fb0013%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6421345&rfr_iscdi=true