{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,17]],"date-time":"2025-12-17T17:50:05Z","timestamp":1765993805453},"reference-count":8,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"content-version":"vor","delay-in-days":9263,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[1981,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This discussion session was concerned with the analysis of heuristics and the design of more effective heuristics. Initially, the group generated a list of evaluation criteria and discussed the strengths and weaknesses of each criterion. Next a classification of heuristic approaches was devised. Finally, the group compiled a list of promising research directions.<\/jats:p>","DOI":"10.1002\/net.3230110210","type":"journal-article","created":{"date-parts":[[2007,5,11]],"date-time":"2007-05-11T12:38:24Z","timestamp":1178887104000},"page":"215-219","source":"Crossref","is-referenced-by-count":25,"title":["The design and analysis of heuristics"],"prefix":"10.1002","volume":"11","author":[{"given":"Michael","family":"Ball","sequence":"first","affiliation":[]},{"given":"Michael","family":"Magazine","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"G. E.BenningtonandK. K.Rebibo \u201cOverview of RUCUS Vehicle Scheduling Program (BLOCKS)\u201d in Preprints: Workshop on Automated Techniques for Scheduling of Vehicle Operators for Urban Public Transportation Services D. Bergmann and L. Bodin Eds. (1975)."},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01584082"},{"key":"e_1_2_1_4_2","unstructured":"M.FisherandR.Jaikumar \u201cA Generalized Assignment Heuristic for Vehicle Routing \u201dNetworks this issue."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.22.2.340"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2.3.209"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.21.2.498"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.10.2.149"},{"key":"e_1_2_1_9_2","unstructured":"E.Wilhelm \u201cOverview of the RUCUS Package Driver Run Cutting Program (RUNS)\u201d in Bergmann and Bodin."}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.3230110210","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.3230110210","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T11:41:17Z","timestamp":1699789277000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230110210"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["10.1002\/net.3230110210"],"URL":"https:\/\/doi.org\/10.1002\/net.3230110210","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,6]]}}}