{"id":"https://openalex.org/W2016304425","doi":"https://doi.org/10.1016/s0305-0548(99)00109-4","title":"An interactive heuristic method for multi-objective combinatorial optimization","display_name":"An interactive heuristic method for multi-objective combinatorial optimization","publication_year":2000,"publication_date":"2000-06-01","ids":{"openalex":"https://openalex.org/W2016304425","doi":"https://doi.org/10.1016/s0305-0548(99)00109-4","mag":"2016304425"},"language":"en","primary_location":{"id":"doi:10.1016/s0305-0548(99)00109-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(99)00109-4","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"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":"Computers & Operations 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/A5082427090","display_name":"Jacques Teghem","orcid":null},"institutions":[{"id":"https://openalex.org/I130929987","display_name":"University of Mons","ror":"https://ror.org/02qnnz951","country_code":"BE","type":"education","lineage":["https://openalex.org/I130929987"]}],"countries":["BE"],"is_corresponding":true,"raw_author_name":"J. Teghem","raw_affiliation_strings":["Laboratory of Mathematics & Operational Research, Facult\u00e9 Polytechnique de Mons, 9, rue de Houdain, B-7000 Mons, Belgium","Laboratory of Mathematics and Operational Research,  Facult\u00e9 Polytechnique de Mons, 9, rue de Houdain B-7000 Mons, Belgium"],"affiliations":[{"raw_affiliation_string":"Laboratory of Mathematics & Operational Research, Facult\u00e9 Polytechnique de Mons, 9, rue de Houdain, B-7000 Mons, Belgium","institution_ids":["https://openalex.org/I130929987"]},{"raw_affiliation_string":"Laboratory of Mathematics and Operational Research,  Facult\u00e9 Polytechnique de Mons, 9, rue de Houdain B-7000 Mons, Belgium","institution_ids":["https://openalex.org/I130929987"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075398977","display_name":"Daniel Tuyttens","orcid":"https://orcid.org/0000-0002-2567-1324"},"institutions":[{"id":"https://openalex.org/I130929987","display_name":"University of Mons","ror":"https://ror.org/02qnnz951","country_code":"BE","type":"education","lineage":["https://openalex.org/I130929987"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"D. Tuyttens","raw_affiliation_strings":["Laboratory of Mathematics & Operational Research, Facult\u00e9 Polytechnique de Mons, 9, rue de Houdain, B-7000 Mons, Belgium","Laboratory of Mathematics and Operational Research,  Facult\u00e9 Polytechnique de Mons, 9, rue de Houdain B-7000 Mons, Belgium"],"affiliations":[{"raw_affiliation_string":"Laboratory of Mathematics & Operational Research, Facult\u00e9 Polytechnique de Mons, 9, rue de Houdain, B-7000 Mons, Belgium","institution_ids":["https://openalex.org/I130929987"]},{"raw_affiliation_string":"Laboratory of Mathematics and Operational Research,  Facult\u00e9 Polytechnique de Mons, 9, rue de Houdain B-7000 Mons, Belgium","institution_ids":["https://openalex.org/I130929987"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070400019","display_name":"E.L. Ulungu","orcid":null},"institutions":[{"id":"https://openalex.org/I130929987","display_name":"University of Mons","ror":"https://ror.org/02qnnz951","country_code":"BE","type":"education","lineage":["https://openalex.org/I130929987"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"E.L. Ulungu","raw_affiliation_strings":["Laboratory of Mathematics & Operational Research, Facult\u00e9 Polytechnique de Mons, 9, rue de Houdain, B-7000 Mons, Belgium","Laboratory of Mathematics and Operational Research,  Facult\u00e9 Polytechnique de Mons, 9, rue de Houdain B-7000 Mons, Belgium"],"affiliations":[{"raw_affiliation_string":"Laboratory of Mathematics & Operational Research, Facult\u00e9 Polytechnique de Mons, 9, rue de Houdain, B-7000 Mons, Belgium","institution_ids":["https://openalex.org/I130929987"]},{"raw_affiliation_string":"Laboratory of Mathematics and Operational Research,  Facult\u00e9 Polytechnique de Mons, 9, rue de Houdain B-7000 Mons, Belgium","institution_ids":["https://openalex.org/I130929987"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5082427090"],"corresponding_institution_ids":["https://openalex.org/I130929987"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":16.9511,"has_fulltext":false,"cited_by_count":59,"citation_normalized_percentile":{"value":0.99255441,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"27","issue":"7-8","first_page":"621","last_page":"634"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9984999895095825,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9984999895095825,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9980999827384949,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/knapsack-problem","display_name":"Knapsack problem","score":0.8335860371589661},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.7626017332077026},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7561423778533936},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"Combinatorial optimization","score":0.627977728843689},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5869478583335876},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.579785943031311},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4974716007709503},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49512162804603577},{"id":"https://openalex.org/keywords/quadratic-assignment-problem","display_name":"Quadratic assignment problem","score":0.47354692220687866},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.47176817059516907},{"id":"https://openalex.org/keywords/cross-entropy-method","display_name":"Cross-entropy method","score":0.4494193196296692},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.44478851556777954},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.43377602100372314},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3428654372692108}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.8335860371589661},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.7626017332077026},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7561423778533936},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.627977728843689},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5869478583335876},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.579785943031311},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4974716007709503},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49512162804603577},{"id":"https://openalex.org/C98036226","wikidata":"https://www.wikidata.org/wiki/Q7268356","display_name":"Quadratic assignment problem","level":3,"score":0.47354692220687866},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.47176817059516907},{"id":"https://openalex.org/C75782508","wikidata":"https://www.wikidata.org/wiki/Q3333633","display_name":"Cross-entropy method","level":4,"score":0.4494193196296692},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.44478851556777954},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.43377602100372314},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3428654372692108},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/s0305-0548(99)00109-4","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(99)00109-4","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"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":"Computers & Operations Research","raw_type":"journal-article"},{"id":"pmh:oai:orbi.umons.ac.be:20.500.12907/28643","is_oa":false,"landing_page_url":"https://orbi.umons.ac.be/handle/20.500.12907/28643","pdf_url":null,"source":{"id":"https://openalex.org/S7407055454","display_name":"ORBi UMONS","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computers and Operations Research, 27, 621-634 (2000-01-01)","raw_type":"peer reviewed"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6700000166893005,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W189214284","https://openalex.org/W1486643454","https://openalex.org/W1559097468","https://openalex.org/W1814097159","https://openalex.org/W2003412293","https://openalex.org/W2065693291","https://openalex.org/W2085830763","https://openalex.org/W2092517593","https://openalex.org/W2112601096","https://openalex.org/W2121928248"],"related_works":["https://openalex.org/W2081359543","https://openalex.org/W2102428370","https://openalex.org/W2972694565","https://openalex.org/W2474680198","https://openalex.org/W2472792831","https://openalex.org/W1594945786","https://openalex.org/W3171554204","https://openalex.org/W128408443","https://openalex.org/W3161231593","https://openalex.org/W2016304425"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}