{"id":"https://openalex.org/W2125835969","doi":"https://doi.org/10.1016/s0377-2217(97)00271-3","title":"Cost optimal allocation of rail passenger lines","display_name":"Cost optimal allocation of rail passenger lines","publication_year":1998,"publication_date":"1998-11-01","ids":{"openalex":"https://openalex.org/W2125835969","doi":"https://doi.org/10.1016/s0377-2217(97)00271-3","mag":"2125835969"},"language":"en","primary_location":{"id":"doi:10.1016/s0377-2217(97)00271-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0377-2217(97)00271-3","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","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/A5056591140","display_name":"M.T. Claessens","orcid":null},"institutions":[{"id":"https://openalex.org/I2802430469","display_name":"Nederlandse Spoorwegen","ror":"https://ror.org/01024mn06","country_code":"NL","type":"company","lineage":["https://openalex.org/I2802430469"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"M.T. Claessens","raw_affiliation_strings":["Netherlands Railways Travelers, P.O. Box 2025, NL-3500 HA Utrecht, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Netherlands Railways Travelers, P.O. Box 2025, NL-3500 HA Utrecht, The Netherlands","institution_ids":["https://openalex.org/I2802430469"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109486072","display_name":"N.M. van Dijk","orcid":null},"institutions":[{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"N.M. van Dijk","raw_affiliation_strings":["University of Amsterdam, Roeterstraat 11, NL-1018 WB Amsterdam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Amsterdam, Roeterstraat 11, NL-1018 WB Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I887064364"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090504585","display_name":"Peter Zwaneveld","orcid":"https://orcid.org/0000-0003-0864-6247"},"institutions":[{"id":"https://openalex.org/I913958620","display_name":"Erasmus University Rotterdam","ror":"https://ror.org/057w15z03","country_code":"NL","type":"education","lineage":["https://openalex.org/I913958620"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"P.J. Zwaneveld","raw_affiliation_strings":["Erasmus University Rotterdam and TNO INRO, P.O. Box 6041, NL-2600 JA Delft, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Erasmus University Rotterdam and TNO INRO, P.O. Box 6041, NL-2600 JA Delft, The Netherlands","institution_ids":["https://openalex.org/I913958620"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5090504585"],"corresponding_institution_ids":["https://openalex.org/I913958620"],"apc_list":{"value":3290,"currency":"USD","value_usd":3290},"apc_paid":null,"fwci":1.2232,"has_fulltext":false,"cited_by_count":191,"citation_normalized_percentile":{"value":0.79952038,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":100},"biblio":{"volume":"110","issue":"3","first_page":"474","last_page":"489"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9977999925613403,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9977999925613403,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12306","display_name":"Urban and Freight Transport Logistics","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7017369866371155},{"id":"https://openalex.org/keywords/train","display_name":"Train","score":0.6555873155593872},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6412813067436218},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.588401198387146},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5293132662773132},{"id":"https://openalex.org/keywords/subnetwork","display_name":"Subnetwork","score":0.4812202751636505},{"id":"https://openalex.org/keywords/constraint-programming","display_name":"Constraint programming","score":0.4705676734447479},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.47050708532333374},{"id":"https://openalex.org/keywords/line","display_name":"Line (geometry)","score":0.4569374620914459},{"id":"https://openalex.org/keywords/branch-and-bound","display_name":"Branch and bound","score":0.45432060956954956},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.442716509103775},{"id":"https://openalex.org/keywords/operations-research","display_name":"Operations research","score":0.4154115319252014},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.31772512197494507},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.24908551573753357},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.17845630645751953},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1722550392150879}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7017369866371155},{"id":"https://openalex.org/C190839683","wikidata":"https://www.wikidata.org/wiki/Q2448197","display_name":"Train","level":2,"score":0.6555873155593872},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6412813067436218},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.588401198387146},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5293132662773132},{"id":"https://openalex.org/C2780186347","wikidata":"https://www.wikidata.org/wiki/Q11414","display_name":"Subnetwork","level":2,"score":0.4812202751636505},{"id":"https://openalex.org/C173404611","wikidata":"https://www.wikidata.org/wiki/Q528588","display_name":"Constraint programming","level":3,"score":0.4705676734447479},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.47050708532333374},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.4569374620914459},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.45432060956954956},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.442716509103775},{"id":"https://openalex.org/C42475967","wikidata":"https://www.wikidata.org/wiki/Q194292","display_name":"Operations research","level":1,"score":0.4154115319252014},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.31772512197494507},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.24908551573753357},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.17845630645751953},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1722550392150879},{"id":"https://openalex.org/C58640448","wikidata":"https://www.wikidata.org/wiki/Q42515","display_name":"Cartography","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/s0377-2217(97)00271-3","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0377-2217(97)00271-3","pdf_url":null,"source":{"id":"https://openalex.org/S103321696","display_name":"European Journal of Operational Research","issn_l":"0377-2217","issn":["0377-2217","1872-6860"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"European Journal of Operational Research","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/49cc4699-f741-4061-9fcf-78ea05a8e04a","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/cost-optimal-allocation-of-mail-passenger-times(49cc4699-f741-4061-9fcf-78ea05a8e04a).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"van Dijk, N M, Claessens, M T & Zwaneveld, P J 1998, 'Cost optimal allocation of mail passenger times', European Journal of Operational Research, vol. 110, pp. 474-489. https://doi.org/10.1016/S0377-2217(97)00271-3","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:dare.uva.nl:publications/49cc4699-f741-4061-9fcf-78ea05a8e04a","is_oa":false,"landing_page_url":"http://dare.uva.nl/personal/pure/en/publications/cost-optimal-allocation-of-mail-passenger-times(49cc4699-f741-4061-9fcf-78ea05a8e04a).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"van Dijk, N M, Claessens, M T & Zwaneveld, P J 1998, 'Cost optimal allocation of mail passenger times', European Journal of Operational Research, vol. 110, pp. 474-489. https://doi.org/10.1016/S0377-2217(97)00271-3","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/49cc4699-f741-4061-9fcf-78ea05a8e04a","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/cost-optimal-allocation-of-mail-passenger-times(49cc4699-f741-4061-9fcf-78ea05a8e04a).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"European Journal of Operational Research, 110, 474 - 489. Elsevier","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1606527972","https://openalex.org/W2011039300","https://openalex.org/W2034621328","https://openalex.org/W2083601726","https://openalex.org/W2106106289","https://openalex.org/W2165032653","https://openalex.org/W2167539320","https://openalex.org/W4242003284","https://openalex.org/W4285719527","https://openalex.org/W6603966478","https://openalex.org/W7020475780"],"related_works":["https://openalex.org/W2060724872","https://openalex.org/W2082094785","https://openalex.org/W2202198356","https://openalex.org/W3087203342","https://openalex.org/W2377184161","https://openalex.org/W228984114","https://openalex.org/W2090026684","https://openalex.org/W4226360758","https://openalex.org/W2907567977","https://openalex.org/W1999926325"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":8},{"year":2025,"cited_by_count":10},{"year":2024,"cited_by_count":10},{"year":2023,"cited_by_count":14},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":13},{"year":2020,"cited_by_count":13},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":9},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":12},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":9},{"year":2012,"cited_by_count":12}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}