Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows

The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints. We present, in this paper, a genetic algorithm for multi-objective optimization of a dynamic multi pickup and delivery pr...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2011-01
Main Authors: Dridi, Imen Harbaoui, Ryan Kammarti, Borne, Pierre, Mekki Ksouri
Format: Article
Language:English
Subjects:
Genetic algorithms
Literature reviews
Lower bounds
Multiple objective analysis
Optimization
Route planning
Routing
Windows (intervals)
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Dridi, Imen Harbaoui
Ryan Kammarti
Borne, Pierre
Mekki Ksouri
description The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints. We present, in this paper, a genetic algorithm for multi-objective optimization of a dynamic multi pickup and delivery problem with time windows (Dynamic m-PDPTW). We propose a brief literature review of the PDPTW, present our approach based on Pareto dominance method and lower bounds, to give a satisfying solution to the Dynamic m-PDPTW minimizing the compromise between total travel cost and total tardiness time. Computational results indicate that the proposed algorithm gives good results with a total tardiness equal to zero with a tolerable cost.
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2085637516</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2085637516</sourcerecordid><originalsourceid>FETCH-proquest_journals_20856375163</originalsourceid><addsrcrecordid>eNqNi8sKgkAUQIcgSMp_uNBa0Jl87DNpE7kQWpaPCa_pjM2MiX19Qn1Aq7M45yyIRRnznGhH6YrYWjeu69IgpL7PLHI7Da1BRxYNLw2-OJx7gx2-c4NSQCIVZDWHeBJ5hyV84xTLx9BDLiqIeTtPaoJUyaLlHYxoasiw43BBUclRb8jynrea2z-uyTY5ZPuj0yv5HLg210YOSszqSt3ID1joewH7r_oA5C5ExA</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2085637516</pqid></control><display><type>article</type><title>Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows</title><source>Publicly Available Content Database</source><creator>Dridi, Imen Harbaoui ; Ryan Kammarti ; Borne, Pierre ; Mekki Ksouri</creator><creatorcontrib>Dridi, Imen Harbaoui ; Ryan Kammarti ; Borne, Pierre ; Mekki Ksouri</creatorcontrib><description>The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints. We present, in this paper, a genetic algorithm for multi-objective optimization of a dynamic multi pickup and delivery problem with time windows (Dynamic m-PDPTW). We propose a brief literature review of the PDPTW, present our approach based on Pareto dominance method and lower bounds, to give a satisfying solution to the Dynamic m-PDPTW minimizing the compromise between total travel cost and total tardiness time. Computational results indicate that the proposed algorithm gives good results with a total tardiness equal to zero with a tolerable cost.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Genetic algorithms ; Literature reviews ; Lower bounds ; Multiple objective analysis ; Optimization ; Route planning ; Routing ; Windows (intervals)</subject><ispartof>arXiv.org, 2011-01</ispartof><rights>2011. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2085637516?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,37012,44590</link.rule.ids></links><search><creatorcontrib>Dridi, Imen Harbaoui</creatorcontrib><creatorcontrib>Ryan Kammarti</creatorcontrib><creatorcontrib>Borne, Pierre</creatorcontrib><creatorcontrib>Mekki Ksouri</creatorcontrib><title>Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows</title><title>arXiv.org</title><description>The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints. We present, in this paper, a genetic algorithm for multi-objective optimization of a dynamic multi pickup and delivery problem with time windows (Dynamic m-PDPTW). We propose a brief literature review of the PDPTW, present our approach based on Pareto dominance method and lower bounds, to give a satisfying solution to the Dynamic m-PDPTW minimizing the compromise between total travel cost and total tardiness time. Computational results indicate that the proposed algorithm gives good results with a total tardiness equal to zero with a tolerable cost.</description><subject>Genetic algorithms</subject><subject>Literature reviews</subject><subject>Lower bounds</subject><subject>Multiple objective analysis</subject><subject>Optimization</subject><subject>Route planning</subject><subject>Routing</subject><subject>Windows (intervals)</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNqNi8sKgkAUQIcgSMp_uNBa0Jl87DNpE7kQWpaPCa_pjM2MiX19Qn1Aq7M45yyIRRnznGhH6YrYWjeu69IgpL7PLHI7Da1BRxYNLw2-OJx7gx2-c4NSQCIVZDWHeBJ5hyV84xTLx9BDLiqIeTtPaoJUyaLlHYxoasiw43BBUclRb8jynrea2z-uyTY5ZPuj0yv5HLg210YOSszqSt3ID1joewH7r_oA5C5ExA</recordid><startdate>20110118</startdate><enddate>20110118</enddate><creator>Dridi, Imen Harbaoui</creator><creator>Ryan Kammarti</creator><creator>Borne, Pierre</creator><creator>Mekki Ksouri</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20110118</creationdate><title>Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows</title><author>Dridi, Imen Harbaoui ; Ryan Kammarti ; Borne, Pierre ; Mekki Ksouri</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20856375163</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Genetic algorithms</topic><topic>Literature reviews</topic><topic>Lower bounds</topic><topic>Multiple objective analysis</topic><topic>Optimization</topic><topic>Route planning</topic><topic>Routing</topic><topic>Windows (intervals)</topic><toplevel>online_resources</toplevel><creatorcontrib>Dridi, Imen Harbaoui</creatorcontrib><creatorcontrib>Ryan Kammarti</creatorcontrib><creatorcontrib>Borne, Pierre</creatorcontrib><creatorcontrib>Mekki Ksouri</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Dridi, Imen Harbaoui</au><au>Ryan Kammarti</au><au>Borne, Pierre</au><au>Mekki Ksouri</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows</atitle><jtitle>arXiv.org</jtitle><date>2011-01-18</date><risdate>2011</risdate><eissn>2331-8422</eissn><abstract>The PDPTW is an optimization vehicles routing problem which must meet requests for transport between suppliers and customers satisfying precedence, capacity and time constraints. We present, in this paper, a genetic algorithm for multi-objective optimization of a dynamic multi pickup and delivery problem with time windows (Dynamic m-PDPTW). We propose a brief literature review of the PDPTW, present our approach based on Pareto dominance method and lower bounds, to give a satisfying solution to the Dynamic m-PDPTW minimizing the compromise between total travel cost and total tardiness time. Computational results indicate that the proposed algorithm gives good results with a total tardiness equal to zero with a tolerable cost.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2011-01
issn 2331-8422
language eng
recordid cdi_proquest_journals_2085637516
source Publicly Available Content Database
subjects Genetic algorithms
Literature reviews
Lower bounds
Multiple objective analysis
Optimization
Route planning
Routing
Windows (intervals)
title Multi-objective Optimization For The Dynamic Multi-Pickup and Delivery Problem with Time Windows
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T16%3A29%3A15IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Multi-objective%20Optimization%20For%20The%20Dynamic%20Multi-Pickup%20and%20Delivery%20Problem%20with%20Time%20Windows&rft.jtitle=arXiv.org&rft.au=Dridi,%20Imen%20Harbaoui&rft.date=2011-01-18&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2085637516%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-proquest_journals_20856375163%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2085637516&rft_id=info:pmid/&rfr_iscdi=true