{"id":"https://openalex.org/W7154571287","doi":"https://doi.org/10.48550/arxiv.2604.13469","title":"Greedy Approaches for Packing While Travelling with Deterministic and Stochastic Constraints","display_name":"Greedy Approaches for Packing While Travelling with Deterministic and Stochastic Constraints","publication_year":2026,"publication_date":"2026-04-15","ids":{"openalex":"https://openalex.org/W7154571287","doi":"https://doi.org/10.48550/arxiv.2604.13469"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.13469","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.13469","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2604.13469","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5115490344","display_name":"Thilina Pathirage Don","orcid":"https://orcid.org/0000-0002-7709-5330"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Don, Thilina Pathirage","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133790459","display_name":"Aneta Neumann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Neumann, Aneta","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5133822875","display_name":"Frank Neumann","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Neumann, Frank","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9480000138282776,"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"}},"topics":[{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9480000138282776,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.009700000286102295,"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.003599999938160181,"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/heuristics","display_name":"Heuristics","score":0.8679999709129333},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7339000105857849},{"id":"https://openalex.org/keywords/packing-problems","display_name":"Packing problems","score":0.6273999810218811},{"id":"https://openalex.org/keywords/component","display_name":"Component (thermodynamics)","score":0.4214000105857849},{"id":"https://openalex.org/keywords/set-packing","display_name":"Set packing","score":0.3124000132083893},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.2777999937534332}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8679999709129333},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7785000205039978},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7339000105857849},{"id":"https://openalex.org/C130253271","wikidata":"https://www.wikidata.org/wiki/Q3851477","display_name":"Packing problems","level":2,"score":0.6273999810218811},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4458000063896179},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.4214000105857849},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40950000286102295},{"id":"https://openalex.org/C134516590","wikidata":"https://www.wikidata.org/wiki/Q475603","display_name":"Set packing","level":3,"score":0.3124000132083893},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C194387892","wikidata":"https://www.wikidata.org/wiki/Q1747770","display_name":"Stochastic optimization","level":2,"score":0.27639999985694885},{"id":"https://openalex.org/C127491075","wikidata":"https://www.wikidata.org/wiki/Q7617825","display_name":"Stochastic modelling","level":2,"score":0.27309998869895935},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.26420000195503235},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.2558000087738037},{"id":"https://openalex.org/C8272713","wikidata":"https://www.wikidata.org/wiki/Q176737","display_name":"Stochastic process","level":2,"score":0.2554999887943268},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.2524000108242035}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.13469","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.13469","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2604.13469","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.13469","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0,27,122],"travelling":[1,30],"thief":[2],"problem":[3,10,31],"(TTP)":[4],"is":[5,33,58,71],"a":[6,48,95],"well-known":[7],"multi-component":[8],"optimisation":[9],"that":[11],"captures":[12],"the":[13,18,23,40,55,65,74,89,105,114,127,130,134],"interdependence":[14],"between":[15],"two":[16],"components:":[17],"tour":[19],"across":[20],"cities":[21],"and":[22,91,112,140],"packing":[24,28,41,56],"of":[25,37,42,67,76,129],"items.":[26],"while":[29],"(PWT)":[32],"an":[34],"NP-hard":[35],"subproblem":[36],"TTP":[38],"where":[39],"items":[43],"should":[44],"be":[45],"optimised":[46],"for":[47,73,109,119],"given":[49],"fixed":[50],"tour.":[51],"In":[52,79],"many":[53],"solvers,":[54],"component":[57],"often":[59],"addressed":[60],"using":[61],"greedy":[62,69,77,110],"heuristics.":[63],"Here,":[64],"use":[66],"suitable":[68],"functions":[70,86,118],"essential":[72],"success":[75],"algorithms.":[78],"this":[80],"paper,":[81],"we":[82,103],"introduce":[83],"new":[84],"reward":[85,117],"tailored":[87,131],"to":[88,94,98],"PWT":[90,108],"extend":[92],"them":[93],"hyper-heuristic":[96],"framework":[97],"achieve":[99],"further":[100],"advantage.":[101],"Furthermore,":[102],"investigate":[104],"chance":[106],"constrained":[107],"approaches":[111],"adopt":[113],"newly":[115],"introduced":[116],"stochastic":[120,141],"weights.":[121],"experimental":[123],"results":[124],"clearly":[125],"demonstrate":[126],"benefit":[128],"heuristics":[132,136],"over":[133],"standard":[135],"in":[137],"both":[138],"deterministic":[139],"constraints.":[142]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-17T00:00:00"}