{"id":"https://openalex.org/W2072551148","doi":"https://doi.org/10.1057/palgrave.jors.2602612","title":"Analysis of algorithms for an online version of the convoy movement problem","display_name":"Analysis of algorithms for an online version of the convoy movement problem","publication_year":2008,"publication_date":"2008-08-06","ids":{"openalex":"https://openalex.org/W2072551148","doi":"https://doi.org/10.1057/palgrave.jors.2602612","mag":"2072551148"},"language":"en","primary_location":{"id":"doi:10.1057/palgrave.jors.2602612","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2602612","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002214587","display_name":"R Gopalan","orcid":null},"institutions":[{"id":"https://openalex.org/I84392919","display_name":"Temple University","ror":"https://ror.org/00kx1jb78","country_code":"US","type":"education","lineage":["https://openalex.org/I84392919"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"R Gopalan","raw_affiliation_strings":["Temple University Philadelphia PA USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Temple University Philadelphia PA USA","institution_ids":["https://openalex.org/I84392919"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049949046","display_name":"N. S. Narayanaswamy","orcid":null},"institutions":[{"id":"https://openalex.org/I24676775","display_name":"Indian Institute of Technology Madras","ror":"https://ror.org/03v0r5n49","country_code":"IN","type":"education","lineage":["https://openalex.org/I24676775"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"N S Narayanaswamy","raw_affiliation_strings":["Indian Institute of Technology Madras Chennai India","Indian Institute of Technology Madras, Chennai India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Indian Institute of Technology Madras Chennai India","institution_ids":["https://openalex.org/I24676775"]},{"raw_affiliation_string":"Indian Institute of Technology Madras, Chennai India","institution_ids":["https://openalex.org/I24676775"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002214587"],"corresponding_institution_ids":["https://openalex.org/I84392919"],"apc_list":null,"apc_paid":null,"fwci":1.3385,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.86906478,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"60","issue":"9","first_page":"1230","last_page":"1236"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.6851229667663574},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6002123951911926},{"id":"https://openalex.org/keywords/headway","display_name":"Headway","score":0.5680596828460693},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5550833940505981},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5415722131729126},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.502605676651001},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.45852699875831604},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30902981758117676},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.17749041318893433},{"id":"https://openalex.org/keywords/simulation","display_name":"Simulation","score":0.17247626185417175},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.1241396963596344}],"concepts":[{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.6851229667663574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6002123951911926},{"id":"https://openalex.org/C2779240695","wikidata":"https://www.wikidata.org/wiki/Q4383682","display_name":"Headway","level":2,"score":0.5680596828460693},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5550833940505981},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5415722131729126},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.502605676651001},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.45852699875831604},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30902981758117676},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.17749041318893433},{"id":"https://openalex.org/C44154836","wikidata":"https://www.wikidata.org/wiki/Q45045","display_name":"Simulation","level":1,"score":0.17247626185417175},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.1241396963596344},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1057/palgrave.jors.2602612","is_oa":false,"landing_page_url":"https://doi.org/10.1057/palgrave.jors.2602612","pdf_url":null,"source":{"id":"https://openalex.org/S169988927","display_name":"Journal of the Operational Research Society","issn_l":"0160-5682","issn":["0160-5682","1476-9360"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319703","host_organization_name":"Palgrave Macmillan","host_organization_lineage":["https://openalex.org/P4310319703","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Palgrave Macmillan","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the Operational Research Society","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:pal:jorsoc:v:60:y:2009:i:9:d:10.1057_palgrave.jors.2602612","is_oa":false,"landing_page_url":"http://link.springer.com/10.1057/palgrave.jors.2602612","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W2003160050","https://openalex.org/W2006146932","https://openalex.org/W2017462525","https://openalex.org/W2071308851","https://openalex.org/W2083173637","https://openalex.org/W2102397714","https://openalex.org/W2146895202","https://openalex.org/W2172223212"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W1930615501"],"abstract_inverted_index":{"In":[0],"the":[1,35,58,73,115,130,134,142,152,170,178,199,202,222,242,256],"convoy":[2,145,180,229,249,261],"movement":[3],"problem":[4],"(CMP),":[5],"a":[6,19,43,62,108,164,191,260],"set":[7],"of":[8,141,155,167,194,204,227],"convoys":[9,28,50,74,85,98,120,205],"must":[10],"be":[11,76,245],"routed":[12,77],"from":[13,123],"specified":[14,63],"origins":[15,125],"to":[16,46,53,75,92,103,113,121,126,201,210,244],"destinations":[17],"in":[18,40,169],"transportation":[20],"network,":[21],"represented":[22],"by":[23,119,247],"an":[24,94,138,160,185,211,214],"undirected":[25],"graph.":[26],"Two":[27],"may":[29],"not":[30],"cross":[31],"each":[32,55,105],"other":[33,56],"on":[34,57,81,133,175,263],"same":[36,59],"edge":[37,95,235,264],"while":[38],"travelling":[39],"opposing":[41],"directions,":[42],"restriction":[44],"referred":[45],"as":[47],"blocking.":[48],"However,":[49],"are":[51,78,90],"permitted":[52,91],"follow":[54,104],"edge,":[60],"with":[61,99,206,213],"headway":[64],"separating":[65],"them,":[66],"but":[67],"no":[68],"overtaking":[69],"is":[70,112,221],"permitted.":[71],"Further,":[72],"distinguished":[79],"based":[80],"their":[82,124,127],"length.":[83],"Particle":[84],"have":[86,102],"zero":[87],"length":[88,101],"and":[89,173,237,253],"traverse":[93],"simultaneously,":[96],"whereas":[97],"non-zero":[100],"other,":[106],"observing":[107],"headway.":[109],"The":[110],"objective":[111],"minimize":[114],"total":[116],"time":[117,258],"taken":[118],"travel":[122,131,257],"destinations,":[128],"given":[129],"constraints":[132],"edges.":[135],"We":[136,196],"consider":[137],"online":[139],"version":[140],"CMP":[143],"where":[144,218],"demands":[146],"arise":[147],"dynamically":[148],"over":[149],"time.":[150],"For":[151,177],"special":[153],"case":[154,172,203],"particle":[156,179],"convoys,":[157],"we":[158,182],"present":[159,184],"algorithm":[161,188,212],"that":[162,189,232,250],"has":[163],"competitive":[165,192,216],"ratio":[166,193],"3":[168],"worst":[171],"(5/2)":[174],"average.":[176],"problem,":[181],"also":[183],"alternate,":[186],"randomized":[187],"provides":[190],"(\u221a13\u22121).":[195],"then":[197],"extend":[198],"results":[200],"length,":[207],"which":[208],"leads":[209],"O(T+CL)":[215],"ratio,":[217],"T={Maxet(e)}/{Minet(e)},":[219],"C":[220],"maximum":[223],"congestion":[224],"(the":[225],"number":[226],"distinct":[228],"origin\u2013destination":[230],"pairs":[231],"use":[233],"any":[234,248],"e)":[236],"L={MaxcL(c)}/{MincL(c)};":[238],"here":[239],"L(c)>0":[240],"represents":[241,255],"time-headway":[243],"observed":[246],"follows":[251],"c":[252,262],"t(e)":[254],"for":[259],"e.":[265]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-22T07:51:19.307946","created_date":"2025-10-10T00:00:00"}