The capacitated team orienteering and profitable tour problems

In this paper, we study the capacitated team orienteering and profitable tour problems (CTOP and CPTP). The interest in these problems comes from recent developments in the use of the Internet for a better matching of demand and offer of transportation services. We propose exact and heuristic proced...

Full description

Saved in:
Bibliographic Details
Published in:The Journal of the Operational Research Society 2009-06, Vol.60 (6), p.831-842
Main Authors: Archetti, C, Feillet, D, Hertz, A, Speranza, M G
Format: Article
Language:English
Subjects:
Algorithms
Applied sciences
branch and price
Business and Management
column generation
Computer Science
Customers
Exact sciences and technology
Heuristics
Management
Operational research. Management science
Operations research
Operations Research/Decision Theory
Optimal solutions
Orienteering
profitable tour problem
Profits
Studies
Taboos
Tabu search
team orienteering problem
Theoretical Paper
Theoretical Papers
Transportation
Travel
Traveling salesman problem
variable neighbourhood search
Vehicle capacity
Vehicle fleets
Vehicles
Vertices
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c589t-4972551de792677fad95db72d4b0c2e144399f5e0384315ed244a6c446fbd6cc3
cites cdi_FETCH-LOGICAL-c589t-4972551de792677fad95db72d4b0c2e144399f5e0384315ed244a6c446fbd6cc3
container_end_page 842
container_issue 6
container_start_page 831
container_title The Journal of the Operational Research Society
container_volume 60
creator Archetti, C
Feillet, D
Hertz, A
Speranza, M G
description In this paper, we study the capacitated team orienteering and profitable tour problems (CTOP and CPTP). The interest in these problems comes from recent developments in the use of the Internet for a better matching of demand and offer of transportation services. We propose exact and heuristic procedures for the CTOP and the CPTP. The computational results show that the heuristic procedures often find the optimal solution and in general cause very limited errors.
doi_str_mv 10.1057/palgrave.jors.2602603
format article
fullrecord <record><control><sourceid>jstor_natur</sourceid><recordid>TN_cdi_nature_primary_2602603</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><jstor_id>40206801</jstor_id><sourcerecordid>40206801</sourcerecordid><originalsourceid>FETCH-LOGICAL-c589t-4972551de792677fad95db72d4b0c2e144399f5e0384315ed244a6c446fbd6cc3</originalsourceid><addsrcrecordid>eNqFUF1rFDEUDaLgWv0JhUHwwYdZbz5n8iKWYlthwZf6HO4mmXaW2cmYZFv6780w2y34oBBIbs5HTg4h5xTWFGTzZcLhLuKDX-9CTGumoCz-iqyoaFStuYLXZAVUQS1Vy96SdyntAEAD1Svy9fbeVxYntH3G7F2VPe6rEHs_Zu9jP95VOLpqiqErhO3gqxwOcZ7LeZ_ekzcdDsl_OO5n5NfV99vLm3rz8_rH5cWmtrLVuRa6YVJS5xvNVNN06LR024Y5sQXLPBWCa91JD7wVnErvmBCorBCq2zplLT8jnxffexzMFPs9xicTsDc3Fxsz3wFlWmvBH2jhfly4JeTvg0_Z7ErkscQzjFPeKs6hkORCsjGkFH13cqVg5lbNc6tmbtUcWy26T0dzTBaHLuJo-3QSMyoko83srxZemuYSfXwJ8b8HzhfhiPkQ_Yvz3_gu5RBPsAAGqoX5998WvB-7EPf4GOLgTManIcTntPzfEf4AcDu29g</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>231386330</pqid></control><display><type>article</type><title>The capacitated team orienteering and profitable tour problems</title><source>Taylor and Francis Science and Technology Collection</source><source>ProQuest ABI/INFORM Global</source><source>JSTOR Archival Journals</source><creator>Archetti, C ; Feillet, D ; Hertz, A ; Speranza, M G</creator><creatorcontrib>Archetti, C ; Feillet, D ; Hertz, A ; Speranza, M G</creatorcontrib><description>In this paper, we study the capacitated team orienteering and profitable tour problems (CTOP and CPTP). The interest in these problems comes from recent developments in the use of the Internet for a better matching of demand and offer of transportation services. We propose exact and heuristic procedures for the CTOP and the CPTP. The computational results show that the heuristic procedures often find the optimal solution and in general cause very limited errors.</description><identifier>ISSN: 0160-5682</identifier><identifier>EISSN: 1476-9360</identifier><identifier>EISSN: 0160-5682</identifier><identifier>DOI: 10.1057/palgrave.jors.2602603</identifier><identifier>CODEN: JORSDZ</identifier><language>eng</language><publisher>London: Taylor &amp; Francis</publisher><subject>Algorithms ; Applied sciences ; branch and price ; Business and Management ; column generation ; Computer Science ; Customers ; Exact sciences and technology ; Heuristics ; Management ; Operational research. Management science ; Operations research ; Operations Research/Decision Theory ; Optimal solutions ; Orienteering ; profitable tour problem ; Profits ; Studies ; Taboos ; Tabu search ; team orienteering problem ; Theoretical Paper ; Theoretical Papers ; Transportation ; Travel ; Traveling salesman problem ; variable neighbourhood search ; Vehicle capacity ; Vehicle fleets ; Vehicles ; Vertices</subject><ispartof>The Journal of the Operational Research Society, 2009-06, Vol.60 (6), p.831-842</ispartof><rights>Copyright © 2008, Palgrave Macmillan 2008</rights><rights>Copyright 2009 Operational Research Society Ltd</rights><rights>Palgrave Macmillan 2008</rights><rights>2009 INIST-CNRS</rights><rights>Palgrave Macmillan 2009</rights><rights>Distributed under a Creative Commons Attribution 4.0 International License</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c589t-4972551de792677fad95db72d4b0c2e144399f5e0384315ed244a6c446fbd6cc3</citedby><cites>FETCH-LOGICAL-c589t-4972551de792677fad95db72d4b0c2e144399f5e0384315ed244a6c446fbd6cc3</cites><orcidid>0000-0002-3524-1600 ; 0000-0003-1246-223X</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.proquest.com/docview/231386330/fulltextPDF?pq-origsite=primo$$EPDF$$P50$$Gproquest$$H</linktopdf><linktohtml>$$Uhttps://www.proquest.com/docview/231386330?pq-origsite=primo$$EHTML$$P50$$Gproquest$$H</linktohtml><link.rule.ids>230,314,780,784,885,11688,27924,27925,36060,44363,58238,58471,74895</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=21452170$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttps://hal.science/hal-01299943$$DView record in HAL$$Hfree_for_read</backlink></links><search><creatorcontrib>Archetti, C</creatorcontrib><creatorcontrib>Feillet, D</creatorcontrib><creatorcontrib>Hertz, A</creatorcontrib><creatorcontrib>Speranza, M G</creatorcontrib><title>The capacitated team orienteering and profitable tour problems</title><title>The Journal of the Operational Research Society</title><addtitle>J Oper Res Soc</addtitle><description>In this paper, we study the capacitated team orienteering and profitable tour problems (CTOP and CPTP). The interest in these problems comes from recent developments in the use of the Internet for a better matching of demand and offer of transportation services. We propose exact and heuristic procedures for the CTOP and the CPTP. The computational results show that the heuristic procedures often find the optimal solution and in general cause very limited errors.</description><subject>Algorithms</subject><subject>Applied sciences</subject><subject>branch and price</subject><subject>Business and Management</subject><subject>column generation</subject><subject>Computer Science</subject><subject>Customers</subject><subject>Exact sciences and technology</subject><subject>Heuristics</subject><subject>Management</subject><subject>Operational research. Management science</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>Optimal solutions</subject><subject>Orienteering</subject><subject>profitable tour problem</subject><subject>Profits</subject><subject>Studies</subject><subject>Taboos</subject><subject>Tabu search</subject><subject>team orienteering problem</subject><subject>Theoretical Paper</subject><subject>Theoretical Papers</subject><subject>Transportation</subject><subject>Travel</subject><subject>Traveling salesman problem</subject><subject>variable neighbourhood search</subject><subject>Vehicle capacity</subject><subject>Vehicle fleets</subject><subject>Vehicles</subject><subject>Vertices</subject><issn>0160-5682</issn><issn>1476-9360</issn><issn>0160-5682</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2009</creationdate><recordtype>article</recordtype><sourceid>M0C</sourceid><recordid>eNqFUF1rFDEUDaLgWv0JhUHwwYdZbz5n8iKWYlthwZf6HO4mmXaW2cmYZFv6780w2y34oBBIbs5HTg4h5xTWFGTzZcLhLuKDX-9CTGumoCz-iqyoaFStuYLXZAVUQS1Vy96SdyntAEAD1Svy9fbeVxYntH3G7F2VPe6rEHs_Zu9jP95VOLpqiqErhO3gqxwOcZ7LeZ_ekzcdDsl_OO5n5NfV99vLm3rz8_rH5cWmtrLVuRa6YVJS5xvNVNN06LR024Y5sQXLPBWCa91JD7wVnErvmBCorBCq2zplLT8jnxffexzMFPs9xicTsDc3Fxsz3wFlWmvBH2jhfly4JeTvg0_Z7ErkscQzjFPeKs6hkORCsjGkFH13cqVg5lbNc6tmbtUcWy26T0dzTBaHLuJo-3QSMyoko83srxZemuYSfXwJ8b8HzhfhiPkQ_Yvz3_gu5RBPsAAGqoX5998WvB-7EPf4GOLgTManIcTntPzfEf4AcDu29g</recordid><startdate>20090601</startdate><enddate>20090601</enddate><creator>Archetti, C</creator><creator>Feillet, D</creator><creator>Hertz, A</creator><creator>Speranza, M G</creator><general>Taylor &amp; Francis</general><general>Palgrave Macmillan</general><general>Palgrave Macmillan UK</general><general>Taylor &amp; Francis Ltd</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>0U~</scope><scope>1-H</scope><scope>3V.</scope><scope>7RQ</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X7</scope><scope>7XB</scope><scope>87Z</scope><scope>88E</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FI</scope><scope>8FJ</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>FYUFA</scope><scope>F~G</scope><scope>GHDGH</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>K9.</scope><scope>L.-</scope><scope>L.0</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M0S</scope><scope>M1P</scope><scope>M2O</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>U9A</scope><scope>1XC</scope><orcidid>https://orcid.org/0000-0002-3524-1600</orcidid><orcidid>https://orcid.org/0000-0003-1246-223X</orcidid></search><sort><creationdate>20090601</creationdate><title>The capacitated team orienteering and profitable tour problems</title><author>Archetti, C ; Feillet, D ; Hertz, A ; Speranza, M G</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c589t-4972551de792677fad95db72d4b0c2e144399f5e0384315ed244a6c446fbd6cc3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2009</creationdate><topic>Algorithms</topic><topic>Applied sciences</topic><topic>branch and price</topic><topic>Business and Management</topic><topic>column generation</topic><topic>Computer Science</topic><topic>Customers</topic><topic>Exact sciences and technology</topic><topic>Heuristics</topic><topic>Management</topic><topic>Operational research. Management science</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>Optimal solutions</topic><topic>Orienteering</topic><topic>profitable tour problem</topic><topic>Profits</topic><topic>Studies</topic><topic>Taboos</topic><topic>Tabu search</topic><topic>team orienteering problem</topic><topic>Theoretical Paper</topic><topic>Theoretical Papers</topic><topic>Transportation</topic><topic>Travel</topic><topic>Traveling salesman problem</topic><topic>variable neighbourhood search</topic><topic>Vehicle capacity</topic><topic>Vehicle fleets</topic><topic>Vehicles</topic><topic>Vertices</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Archetti, C</creatorcontrib><creatorcontrib>Feillet, D</creatorcontrib><creatorcontrib>Hertz, A</creatorcontrib><creatorcontrib>Speranza, M G</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Global News &amp; ABI/Inform Professional</collection><collection>Trade PRO</collection><collection>ProQuest Central (Corporate)</collection><collection>Career &amp; Technical Education Database</collection><collection>ProQuest_ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Health and Medical</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Medical Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Hospital Premium Collection</collection><collection>Hospital Premium Collection (Alumni Edition)</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>ProQuest Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>Business Premium Collection (Alumni)</collection><collection>Health Research Premium Collection</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>Health Research Premium Collection (Alumni)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer science database</collection><collection>ProQuest Health &amp; Medical Complete (Alumni)</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ABI/INFORM Professional Standard</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Health &amp; Medical Collection (Alumni Edition)</collection><collection>Medical Database</collection><collection>ProQuest_Research Library</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>ProQuest advanced technologies &amp; aerospace journals</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>One Business (ProQuest)</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering collection</collection><collection>ProQuest Central Basic</collection><collection>Hyper Article en Ligne (HAL)</collection><jtitle>The Journal of the Operational Research Society</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Archetti, C</au><au>Feillet, D</au><au>Hertz, A</au><au>Speranza, M G</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>The capacitated team orienteering and profitable tour problems</atitle><jtitle>The Journal of the Operational Research Society</jtitle><stitle>J Oper Res Soc</stitle><date>2009-06-01</date><risdate>2009</risdate><volume>60</volume><issue>6</issue><spage>831</spage><epage>842</epage><pages>831-842</pages><issn>0160-5682</issn><eissn>1476-9360</eissn><eissn>0160-5682</eissn><coden>JORSDZ</coden><abstract>In this paper, we study the capacitated team orienteering and profitable tour problems (CTOP and CPTP). The interest in these problems comes from recent developments in the use of the Internet for a better matching of demand and offer of transportation services. We propose exact and heuristic procedures for the CTOP and the CPTP. The computational results show that the heuristic procedures often find the optimal solution and in general cause very limited errors.</abstract><cop>London</cop><pub>Taylor &amp; Francis</pub><doi>10.1057/palgrave.jors.2602603</doi><tpages>12</tpages><orcidid>https://orcid.org/0000-0002-3524-1600</orcidid><orcidid>https://orcid.org/0000-0003-1246-223X</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0160-5682
ispartof The Journal of the Operational Research Society, 2009-06, Vol.60 (6), p.831-842
issn 0160-5682
1476-9360
0160-5682
language eng
recordid cdi_nature_primary_2602603
source Taylor and Francis Science and Technology Collection; ProQuest ABI/INFORM Global; JSTOR Archival Journals
subjects Algorithms
Applied sciences
branch and price
Business and Management
column generation
Computer Science
Customers
Exact sciences and technology
Heuristics
Management
Operational research. Management science
Operations research
Operations Research/Decision Theory
Optimal solutions
Orienteering
profitable tour problem
Profits
Studies
Taboos
Tabu search
team orienteering problem
Theoretical Paper
Theoretical Papers
Transportation
Travel
Traveling salesman problem
variable neighbourhood search
Vehicle capacity
Vehicle fleets
Vehicles
Vertices
title The capacitated team orienteering and profitable tour problems
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-27T14%3A25%3A53IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-jstor_natur&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=The%20capacitated%20team%20orienteering%20and%20profitable%20tour%20problems&rft.jtitle=The%20Journal%20of%20the%20Operational%20Research%20Society&rft.au=Archetti,%20C&rft.date=2009-06-01&rft.volume=60&rft.issue=6&rft.spage=831&rft.epage=842&rft.pages=831-842&rft.issn=0160-5682&rft.eissn=1476-9360&rft.coden=JORSDZ&rft_id=info:doi/10.1057/palgrave.jors.2602603&rft_dat=%3Cjstor_natur%3E40206801%3C/jstor_natur%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c589t-4972551de792677fad95db72d4b0c2e144399f5e0384315ed244a6c446fbd6cc3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=231386330&rft_id=info:pmid/&rft_jstor_id=40206801&rfr_iscdi=true