An Inverse Optimal Value Approach for Synchronously Optimizing Activity Durations and Worker Assignments with a Project Ideal Cost Article Swipe
Lili Zhang
,
Zhengrui Chen
,
Dan Shi
,
Yanan Zhao
·
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.3390/math11051178
YOU?
·
· 2023
· Open Access
·
· DOI: https://doi.org/10.3390/math11051178
Most companies survive the pain of cost and schedule overruns because of inaccurate project activity time settings. In order to deliver a project with a target cost and on schedule, this research proposes an inverse optimal value approach to optimize activity durations and the corresponding worker assignments synchronously to make the optimal project cost infinitely close to an ideal cost. The leader model reflects cost orientation and adjustability of activity durations, the follower model reflects the complexity of activity sequence, critical path completion time, cost pressure, skill matching, energy consumption, and other costs. Through upper-level and lower-level feedback and interaction of activity durations and worker assignments it is possible to deliver a project with an ideal cost. With considerations of the mathematical model characteristics of bi-level programming, nonlinearity, NP hard, and MAX functions, an improved genetic algorithm combining adaptive artificial fish swarms is designed. From the comparison results of random examples and an actual example, the error rate of the optimal value of the improved algorithm is acceptable. Numerical experiments show that the inverse optimal approach can deliver a project without delay and with an ideal cost. The inverse optimization method is more in line with the idea of target management, and can help managers achieve the purpose of cost control.
Related Topics
Concepts
Metadata
- Type
- article
- Language
- en
- Landing Page
- https://doi.org/10.3390/math11051178
- https://www.mdpi.com/2227-7390/11/5/1178/pdf?version=1677566103
- OA Status
- gold
- Cited By
- 2
- References
- 37
- Related Works
- 10
- OpenAlex ID
- https://openalex.org/W4323314045
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4323314045Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.3390/math11051178Digital Object Identifier
- Title
-
An Inverse Optimal Value Approach for Synchronously Optimizing Activity Durations and Worker Assignments with a Project Ideal CostWork title
- Type
-
articleOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2023Year of publication
- Publication date
-
2023-02-27Full publication date if available
- Authors
-
Lili Zhang, Zhengrui Chen, Dan Shi, Yanan ZhaoList of authors in order
- Landing page
-
https://doi.org/10.3390/math11051178Publisher landing page
- PDF URL
-
https://www.mdpi.com/2227-7390/11/5/1178/pdf?version=1677566103Direct link to full text PDF
- Open access
-
YesWhether a free full text is available
- OA status
-
goldOpen access status per OpenAlex
- OA URL
-
https://www.mdpi.com/2227-7390/11/5/1178/pdf?version=1677566103Direct OA link when available
- Concepts
-
Schedule, Mathematical optimization, Computer science, Ideal (ethics), Inverse, Matching (statistics), Genetic algorithm, Mathematics, Statistics, Geometry, Philosophy, Epistemology, Operating systemTop concepts (fields/topics) attached by OpenAlex
- Cited by
-
2Total citation count in OpenAlex
- Citations by year (recent)
-
2023: 2Per-year citation counts (last 5 years)
- References (count)
-
37Number of works referenced by this work
- Related works (count)
-
10Other works algorithmically related by OpenAlex
Full payload
| id | https://openalex.org/W4323314045 |
|---|---|
| doi | https://doi.org/10.3390/math11051178 |
| ids.doi | https://doi.org/10.3390/math11051178 |
| ids.openalex | https://openalex.org/W4323314045 |
| fwci | 0.64697809 |
| type | article |
| title | An Inverse Optimal Value Approach for Synchronously Optimizing Activity Durations and Worker Assignments with a Project Ideal Cost |
| awards[0].id | https://openalex.org/G4008770347 |
| awards[0].funder_id | https://openalex.org/F4320321001 |
| awards[0].display_name | |
| awards[0].funder_award_id | 71771036 |
| awards[0].funder_display_name | National Natural Science Foundation of China |
| awards[1].id | https://openalex.org/G5777270785 |
| awards[1].funder_id | https://openalex.org/F4320321001 |
| awards[1].display_name | |
| awards[1].funder_award_id | 72271038 |
| awards[1].funder_display_name | National Natural Science Foundation of China |
| biblio.issue | 5 |
| biblio.volume | 11 |
| biblio.last_page | 1178 |
| biblio.first_page | 1178 |
| topics[0].id | https://openalex.org/T12177 |
| topics[0].field.id | https://openalex.org/fields/18 |
| topics[0].field.display_name | Decision Sciences |
| topics[0].score | 0.9977999925613403 |
| topics[0].domain.id | https://openalex.org/domains/2 |
| topics[0].domain.display_name | Social Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1803 |
| topics[0].subfield.display_name | Management Science and Operations Research |
| topics[0].display_name | Resource-Constrained Project Scheduling |
| topics[1].id | https://openalex.org/T10551 |
| topics[1].field.id | https://openalex.org/fields/22 |
| topics[1].field.display_name | Engineering |
| topics[1].score | 0.9921000003814697 |
| topics[1].domain.id | https://openalex.org/domains/3 |
| topics[1].domain.display_name | Physical Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/2209 |
| topics[1].subfield.display_name | Industrial and Manufacturing Engineering |
| topics[1].display_name | Scheduling and Optimization Algorithms |
| topics[2].id | https://openalex.org/T10328 |
| topics[2].field.id | https://openalex.org/fields/14 |
| topics[2].field.display_name | Business, Management and Accounting |
| topics[2].score | 0.989799976348877 |
| topics[2].domain.id | https://openalex.org/domains/2 |
| topics[2].domain.display_name | Social Sciences |
| topics[2].subfield.id | https://openalex.org/subfields/1404 |
| topics[2].subfield.display_name | Management Information Systems |
| topics[2].display_name | Supply Chain and Inventory Management |
| funders[0].id | https://openalex.org/F4320321001 |
| funders[0].ror | https://ror.org/01h0zpd94 |
| funders[0].display_name | National Natural Science Foundation of China |
| is_xpac | False |
| apc_list.value | 1800 |
| apc_list.currency | CHF |
| apc_list.value_usd | 1949 |
| apc_paid.value | 1800 |
| apc_paid.currency | CHF |
| apc_paid.value_usd | 1949 |
| concepts[0].id | https://openalex.org/C68387754 |
| concepts[0].level | 2 |
| concepts[0].score | 0.6669483184814453 |
| concepts[0].wikidata | https://www.wikidata.org/wiki/Q7271585 |
| concepts[0].display_name | Schedule |
| concepts[1].id | https://openalex.org/C126255220 |
| concepts[1].level | 1 |
| concepts[1].score | 0.6534723043441772 |
| concepts[1].wikidata | https://www.wikidata.org/wiki/Q141495 |
| concepts[1].display_name | Mathematical optimization |
| concepts[2].id | https://openalex.org/C41008148 |
| concepts[2].level | 0 |
| concepts[2].score | 0.5853622555732727 |
| concepts[2].wikidata | https://www.wikidata.org/wiki/Q21198 |
| concepts[2].display_name | Computer science |
| concepts[3].id | https://openalex.org/C2776639384 |
| concepts[3].level | 2 |
| concepts[3].score | 0.5668942332267761 |
| concepts[3].wikidata | https://www.wikidata.org/wiki/Q840396 |
| concepts[3].display_name | Ideal (ethics) |
| concepts[4].id | https://openalex.org/C207467116 |
| concepts[4].level | 2 |
| concepts[4].score | 0.5118829011917114 |
| concepts[4].wikidata | https://www.wikidata.org/wiki/Q4385666 |
| concepts[4].display_name | Inverse |
| concepts[5].id | https://openalex.org/C165064840 |
| concepts[5].level | 2 |
| concepts[5].score | 0.4485020041465759 |
| concepts[5].wikidata | https://www.wikidata.org/wiki/Q1321061 |
| concepts[5].display_name | Matching (statistics) |
| concepts[6].id | https://openalex.org/C8880873 |
| concepts[6].level | 2 |
| concepts[6].score | 0.41130000352859497 |
| concepts[6].wikidata | https://www.wikidata.org/wiki/Q187787 |
| concepts[6].display_name | Genetic algorithm |
| concepts[7].id | https://openalex.org/C33923547 |
| concepts[7].level | 0 |
| concepts[7].score | 0.21588754653930664 |
| concepts[7].wikidata | https://www.wikidata.org/wiki/Q395 |
| concepts[7].display_name | Mathematics |
| concepts[8].id | https://openalex.org/C105795698 |
| concepts[8].level | 1 |
| concepts[8].score | 0.0 |
| concepts[8].wikidata | https://www.wikidata.org/wiki/Q12483 |
| concepts[8].display_name | Statistics |
| concepts[9].id | https://openalex.org/C2524010 |
| concepts[9].level | 1 |
| concepts[9].score | 0.0 |
| concepts[9].wikidata | https://www.wikidata.org/wiki/Q8087 |
| concepts[9].display_name | Geometry |
| concepts[10].id | https://openalex.org/C138885662 |
| concepts[10].level | 0 |
| concepts[10].score | 0.0 |
| concepts[10].wikidata | https://www.wikidata.org/wiki/Q5891 |
| concepts[10].display_name | Philosophy |
| concepts[11].id | https://openalex.org/C111472728 |
| concepts[11].level | 1 |
| concepts[11].score | 0.0 |
| concepts[11].wikidata | https://www.wikidata.org/wiki/Q9471 |
| concepts[11].display_name | Epistemology |
| concepts[12].id | https://openalex.org/C111919701 |
| concepts[12].level | 1 |
| concepts[12].score | 0.0 |
| concepts[12].wikidata | https://www.wikidata.org/wiki/Q9135 |
| concepts[12].display_name | Operating system |
| keywords[0].id | https://openalex.org/keywords/schedule |
| keywords[0].score | 0.6669483184814453 |
| keywords[0].display_name | Schedule |
| keywords[1].id | https://openalex.org/keywords/mathematical-optimization |
| keywords[1].score | 0.6534723043441772 |
| keywords[1].display_name | Mathematical optimization |
| keywords[2].id | https://openalex.org/keywords/computer-science |
| keywords[2].score | 0.5853622555732727 |
| keywords[2].display_name | Computer science |
| keywords[3].id | https://openalex.org/keywords/ideal |
| keywords[3].score | 0.5668942332267761 |
| keywords[3].display_name | Ideal (ethics) |
| keywords[4].id | https://openalex.org/keywords/inverse |
| keywords[4].score | 0.5118829011917114 |
| keywords[4].display_name | Inverse |
| keywords[5].id | https://openalex.org/keywords/matching |
| keywords[5].score | 0.4485020041465759 |
| keywords[5].display_name | Matching (statistics) |
| keywords[6].id | https://openalex.org/keywords/genetic-algorithm |
| keywords[6].score | 0.41130000352859497 |
| keywords[6].display_name | Genetic algorithm |
| keywords[7].id | https://openalex.org/keywords/mathematics |
| keywords[7].score | 0.21588754653930664 |
| keywords[7].display_name | Mathematics |
| language | en |
| locations[0].id | doi:10.3390/math11051178 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4210192031 |
| locations[0].source.issn | 2227-7390 |
| locations[0].source.type | journal |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | 2227-7390 |
| locations[0].source.is_core | True |
| locations[0].source.is_in_doaj | True |
| locations[0].source.display_name | Mathematics |
| locations[0].source.host_organization | https://openalex.org/P4310310987 |
| locations[0].source.host_organization_name | Multidisciplinary Digital Publishing Institute |
| locations[0].source.host_organization_lineage | https://openalex.org/P4310310987 |
| locations[0].source.host_organization_lineage_names | Multidisciplinary Digital Publishing Institute |
| locations[0].license | cc-by |
| locations[0].pdf_url | https://www.mdpi.com/2227-7390/11/5/1178/pdf?version=1677566103 |
| locations[0].version | publishedVersion |
| locations[0].raw_type | journal-article |
| locations[0].license_id | https://openalex.org/licenses/cc-by |
| locations[0].is_accepted | True |
| locations[0].is_published | True |
| locations[0].raw_source_name | Mathematics |
| locations[0].landing_page_url | https://doi.org/10.3390/math11051178 |
| locations[1].id | pmh:oai:doaj.org/article:e591f8c1c6c24bc7bfff47af41f3d51b |
| locations[1].is_oa | False |
| locations[1].source.id | https://openalex.org/S4306401280 |
| locations[1].source.issn | |
| locations[1].source.type | repository |
| locations[1].source.is_oa | False |
| locations[1].source.issn_l | |
| locations[1].source.is_core | False |
| locations[1].source.is_in_doaj | False |
| locations[1].source.display_name | DOAJ (DOAJ: Directory of Open Access Journals) |
| locations[1].source.host_organization | |
| locations[1].source.host_organization_name | |
| locations[1].license | |
| locations[1].pdf_url | |
| locations[1].version | submittedVersion |
| locations[1].raw_type | article |
| locations[1].license_id | |
| locations[1].is_accepted | False |
| locations[1].is_published | False |
| locations[1].raw_source_name | Mathematics, Vol 11, Iss 5, p 1178 (2023) |
| locations[1].landing_page_url | https://doaj.org/article/e591f8c1c6c24bc7bfff47af41f3d51b |
| locations[2].id | pmh:oai:mdpi.com:/2227-7390/11/5/1178/ |
| locations[2].is_oa | True |
| locations[2].source.id | https://openalex.org/S4306400947 |
| locations[2].source.issn | |
| locations[2].source.type | repository |
| locations[2].source.is_oa | True |
| locations[2].source.issn_l | |
| locations[2].source.is_core | False |
| locations[2].source.is_in_doaj | False |
| locations[2].source.display_name | MDPI (MDPI AG) |
| locations[2].source.host_organization | https://openalex.org/I4210097602 |
| locations[2].source.host_organization_name | Multidisciplinary Digital Publishing Institute (Switzerland) |
| locations[2].source.host_organization_lineage | https://openalex.org/I4210097602 |
| locations[2].license | cc-by |
| locations[2].pdf_url | |
| locations[2].version | submittedVersion |
| locations[2].raw_type | Text |
| locations[2].license_id | https://openalex.org/licenses/cc-by |
| locations[2].is_accepted | False |
| locations[2].is_published | False |
| locations[2].raw_source_name | Mathematics |
| locations[2].landing_page_url | https://dx.doi.org/10.3390/math11051178 |
| indexed_in | crossref, doaj |
| authorships[0].author.id | https://openalex.org/A5100461199 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-7535-1601 |
| authorships[0].author.display_name | Lili Zhang |
| authorships[0].countries | CN |
| authorships[0].affiliations[0].institution_ids | https://openalex.org/I43313876 |
| authorships[0].affiliations[0].raw_affiliation_string | School of Maritime Economics and Management, Dalian Maritime University, Dalian 116026, China |
| authorships[0].institutions[0].id | https://openalex.org/I43313876 |
| authorships[0].institutions[0].ror | https://ror.org/002b7nr53 |
| authorships[0].institutions[0].type | education |
| authorships[0].institutions[0].lineage | https://openalex.org/I43313876 |
| authorships[0].institutions[0].country_code | CN |
| authorships[0].institutions[0].display_name | Dalian Maritime University |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Lili Zhang |
| authorships[0].is_corresponding | True |
| authorships[0].raw_affiliation_strings | School of Maritime Economics and Management, Dalian Maritime University, Dalian 116026, China |
| authorships[1].author.id | https://openalex.org/A5104159351 |
| authorships[1].author.orcid | |
| authorships[1].author.display_name | Zhengrui Chen |
| authorships[1].countries | CN |
| authorships[1].affiliations[0].institution_ids | https://openalex.org/I27357992 |
| authorships[1].affiliations[0].raw_affiliation_string | School of Business, Dalian University of Technology, Panjin 124221, China |
| authorships[1].institutions[0].id | https://openalex.org/I27357992 |
| authorships[1].institutions[0].ror | https://ror.org/023hj5876 |
| authorships[1].institutions[0].type | education |
| authorships[1].institutions[0].lineage | https://openalex.org/I27357992 |
| authorships[1].institutions[0].country_code | CN |
| authorships[1].institutions[0].display_name | Dalian University of Technology |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Zhengrui Chen |
| authorships[1].is_corresponding | False |
| authorships[1].raw_affiliation_strings | School of Business, Dalian University of Technology, Panjin 124221, China |
| authorships[2].author.id | https://openalex.org/A5069289304 |
| authorships[2].author.orcid | https://orcid.org/0000-0001-8359-8308 |
| authorships[2].author.display_name | Dan Shi |
| authorships[2].countries | CN |
| authorships[2].affiliations[0].institution_ids | https://openalex.org/I27357992 |
| authorships[2].affiliations[0].raw_affiliation_string | School of Business, Dalian University of Technology, Panjin 124221, China |
| authorships[2].institutions[0].id | https://openalex.org/I27357992 |
| authorships[2].institutions[0].ror | https://ror.org/023hj5876 |
| authorships[2].institutions[0].type | education |
| authorships[2].institutions[0].lineage | https://openalex.org/I27357992 |
| authorships[2].institutions[0].country_code | CN |
| authorships[2].institutions[0].display_name | Dalian University of Technology |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Dan Shi |
| authorships[2].is_corresponding | False |
| authorships[2].raw_affiliation_strings | School of Business, Dalian University of Technology, Panjin 124221, China |
| authorships[3].author.id | https://openalex.org/A5061034173 |
| authorships[3].author.orcid | https://orcid.org/0000-0001-8173-7773 |
| authorships[3].author.display_name | Yanan Zhao |
| authorships[3].countries | CN |
| authorships[3].affiliations[0].institution_ids | https://openalex.org/I166846921 |
| authorships[3].affiliations[0].raw_affiliation_string | School of Economics and Management, Liaoning Petrochemical University, Fushun 113001, China |
| authorships[3].institutions[0].id | https://openalex.org/I166846921 |
| authorships[3].institutions[0].ror | https://ror.org/00k6c4h29 |
| authorships[3].institutions[0].type | education |
| authorships[3].institutions[0].lineage | https://openalex.org/I166846921 |
| authorships[3].institutions[0].country_code | CN |
| authorships[3].institutions[0].display_name | Liaoning Shihua University |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | Yanan Zhao |
| authorships[3].is_corresponding | False |
| authorships[3].raw_affiliation_strings | School of Economics and Management, Liaoning Petrochemical University, Fushun 113001, China |
| has_content.pdf | True |
| has_content.grobid_xml | True |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://www.mdpi.com/2227-7390/11/5/1178/pdf?version=1677566103 |
| open_access.oa_status | gold |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-10T00:00:00 |
| display_name | An Inverse Optimal Value Approach for Synchronously Optimizing Activity Durations and Worker Assignments with a Project Ideal Cost |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T03:46:38.306776 |
| primary_topic.id | https://openalex.org/T12177 |
| primary_topic.field.id | https://openalex.org/fields/18 |
| primary_topic.field.display_name | Decision Sciences |
| primary_topic.score | 0.9977999925613403 |
| primary_topic.domain.id | https://openalex.org/domains/2 |
| primary_topic.domain.display_name | Social Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1803 |
| primary_topic.subfield.display_name | Management Science and Operations Research |
| primary_topic.display_name | Resource-Constrained Project Scheduling |
| related_works | https://openalex.org/W2590472383, https://openalex.org/W2383873009, https://openalex.org/W2393580911, https://openalex.org/W2212184297, https://openalex.org/W3156456913, https://openalex.org/W2390945180, https://openalex.org/W2394052932, https://openalex.org/W2350360626, https://openalex.org/W2737552886, https://openalex.org/W3207130397 |
| cited_by_count | 2 |
| counts_by_year[0].year | 2023 |
| counts_by_year[0].cited_by_count | 2 |
| locations_count | 3 |
| best_oa_location.id | doi:10.3390/math11051178 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4210192031 |
| best_oa_location.source.issn | 2227-7390 |
| best_oa_location.source.type | journal |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | 2227-7390 |
| best_oa_location.source.is_core | True |
| best_oa_location.source.is_in_doaj | True |
| best_oa_location.source.display_name | Mathematics |
| best_oa_location.source.host_organization | https://openalex.org/P4310310987 |
| best_oa_location.source.host_organization_name | Multidisciplinary Digital Publishing Institute |
| best_oa_location.source.host_organization_lineage | https://openalex.org/P4310310987 |
| best_oa_location.source.host_organization_lineage_names | Multidisciplinary Digital Publishing Institute |
| best_oa_location.license | cc-by |
| best_oa_location.pdf_url | https://www.mdpi.com/2227-7390/11/5/1178/pdf?version=1677566103 |
| best_oa_location.version | publishedVersion |
| best_oa_location.raw_type | journal-article |
| best_oa_location.license_id | https://openalex.org/licenses/cc-by |
| best_oa_location.is_accepted | True |
| best_oa_location.is_published | True |
| best_oa_location.raw_source_name | Mathematics |
| best_oa_location.landing_page_url | https://doi.org/10.3390/math11051178 |
| primary_location.id | doi:10.3390/math11051178 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4210192031 |
| primary_location.source.issn | 2227-7390 |
| primary_location.source.type | journal |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | 2227-7390 |
| primary_location.source.is_core | True |
| primary_location.source.is_in_doaj | True |
| primary_location.source.display_name | Mathematics |
| primary_location.source.host_organization | https://openalex.org/P4310310987 |
| primary_location.source.host_organization_name | Multidisciplinary Digital Publishing Institute |
| primary_location.source.host_organization_lineage | https://openalex.org/P4310310987 |
| primary_location.source.host_organization_lineage_names | Multidisciplinary Digital Publishing Institute |
| primary_location.license | cc-by |
| primary_location.pdf_url | https://www.mdpi.com/2227-7390/11/5/1178/pdf?version=1677566103 |
| primary_location.version | publishedVersion |
| primary_location.raw_type | journal-article |
| primary_location.license_id | https://openalex.org/licenses/cc-by |
| primary_location.is_accepted | True |
| primary_location.is_published | True |
| primary_location.raw_source_name | Mathematics |
| primary_location.landing_page_url | https://doi.org/10.3390/math11051178 |
| publication_date | 2023-02-27 |
| publication_year | 2023 |
| referenced_works | https://openalex.org/W2112126133, https://openalex.org/W4293706291, https://openalex.org/W2058795649, https://openalex.org/W4221028629, https://openalex.org/W4285270613, https://openalex.org/W2464025377, https://openalex.org/W4306179714, https://openalex.org/W3089171277, https://openalex.org/W2044604833, https://openalex.org/W6708816102, https://openalex.org/W4309883744, https://openalex.org/W4313365552, https://openalex.org/W4309001838, https://openalex.org/W4306411422, https://openalex.org/W4225015619, https://openalex.org/W4224258053, https://openalex.org/W1979134936, https://openalex.org/W2070506258, https://openalex.org/W2131140226, https://openalex.org/W3087425397, https://openalex.org/W2962997955, https://openalex.org/W3216050790, https://openalex.org/W2161875403, https://openalex.org/W2131390263, https://openalex.org/W2565874854, https://openalex.org/W6725166484, https://openalex.org/W2794469634, https://openalex.org/W2963474773, https://openalex.org/W3122987013, https://openalex.org/W4205484458, https://openalex.org/W4226078145, https://openalex.org/W3121913816, https://openalex.org/W2124659975, https://openalex.org/W2323525722, https://openalex.org/W3124103967, https://openalex.org/W2369454286, https://openalex.org/W1491314944 |
| referenced_works_count | 37 |
| abstract_inverted_index.a | 21, 24, 111, 178 |
| abstract_inverted_index.In | 17 |
| abstract_inverted_index.NP | 128 |
| abstract_inverted_index.an | 33, 57, 114, 133, 152, 184 |
| abstract_inverted_index.in | 193 |
| abstract_inverted_index.is | 107, 142, 166, 191 |
| abstract_inverted_index.it | 106 |
| abstract_inverted_index.of | 5, 11, 68, 77, 100, 119, 124, 148, 158, 162, 198, 208 |
| abstract_inverted_index.on | 28 |
| abstract_inverted_index.to | 19, 38, 48, 56, 109 |
| abstract_inverted_index.MAX | 131 |
| abstract_inverted_index.The | 60, 187 |
| abstract_inverted_index.and | 7, 27, 42, 66, 90, 95, 98, 103, 130, 151, 182, 201 |
| abstract_inverted_index.can | 176, 202 |
| abstract_inverted_index.the | 3, 43, 50, 71, 75, 120, 145, 155, 159, 163, 172, 196, 206 |
| abstract_inverted_index.From | 144 |
| abstract_inverted_index.Most | 0 |
| abstract_inverted_index.With | 117 |
| abstract_inverted_index.cost | 6, 26, 53, 64, 84, 209 |
| abstract_inverted_index.fish | 140 |
| abstract_inverted_index.help | 203 |
| abstract_inverted_index.idea | 197 |
| abstract_inverted_index.line | 194 |
| abstract_inverted_index.make | 49 |
| abstract_inverted_index.more | 192 |
| abstract_inverted_index.pain | 4 |
| abstract_inverted_index.path | 81 |
| abstract_inverted_index.rate | 157 |
| abstract_inverted_index.show | 170 |
| abstract_inverted_index.that | 171 |
| abstract_inverted_index.this | 30 |
| abstract_inverted_index.time | 15 |
| abstract_inverted_index.with | 23, 113, 183, 195 |
| abstract_inverted_index.close | 55 |
| abstract_inverted_index.cost. | 59, 116, 186 |
| abstract_inverted_index.delay | 181 |
| abstract_inverted_index.error | 156 |
| abstract_inverted_index.hard, | 129 |
| abstract_inverted_index.ideal | 58, 115, 185 |
| abstract_inverted_index.model | 62, 73, 122 |
| abstract_inverted_index.order | 18 |
| abstract_inverted_index.other | 91 |
| abstract_inverted_index.skill | 86 |
| abstract_inverted_index.time, | 83 |
| abstract_inverted_index.value | 36, 161 |
| abstract_inverted_index.actual | 153 |
| abstract_inverted_index.costs. | 92 |
| abstract_inverted_index.energy | 88 |
| abstract_inverted_index.leader | 61 |
| abstract_inverted_index.method | 190 |
| abstract_inverted_index.random | 149 |
| abstract_inverted_index.swarms | 141 |
| abstract_inverted_index.target | 25, 199 |
| abstract_inverted_index.worker | 45, 104 |
| abstract_inverted_index.Through | 93 |
| abstract_inverted_index.achieve | 205 |
| abstract_inverted_index.because | 10 |
| abstract_inverted_index.deliver | 20, 110, 177 |
| abstract_inverted_index.genetic | 135 |
| abstract_inverted_index.inverse | 34, 173, 188 |
| abstract_inverted_index.optimal | 35, 51, 160, 174 |
| abstract_inverted_index.project | 13, 22, 52, 112, 179 |
| abstract_inverted_index.purpose | 207 |
| abstract_inverted_index.results | 147 |
| abstract_inverted_index.survive | 2 |
| abstract_inverted_index.without | 180 |
| abstract_inverted_index.activity | 14, 40, 69, 78, 101 |
| abstract_inverted_index.adaptive | 138 |
| abstract_inverted_index.approach | 37, 175 |
| abstract_inverted_index.bi-level | 125 |
| abstract_inverted_index.control. | 210 |
| abstract_inverted_index.critical | 80 |
| abstract_inverted_index.example, | 154 |
| abstract_inverted_index.examples | 150 |
| abstract_inverted_index.feedback | 97 |
| abstract_inverted_index.follower | 72 |
| abstract_inverted_index.improved | 134, 164 |
| abstract_inverted_index.managers | 204 |
| abstract_inverted_index.optimize | 39 |
| abstract_inverted_index.overruns | 9 |
| abstract_inverted_index.possible | 108 |
| abstract_inverted_index.proposes | 32 |
| abstract_inverted_index.reflects | 63, 74 |
| abstract_inverted_index.research | 31 |
| abstract_inverted_index.schedule | 8 |
| abstract_inverted_index.Numerical | 168 |
| abstract_inverted_index.algorithm | 136, 165 |
| abstract_inverted_index.combining | 137 |
| abstract_inverted_index.companies | 1 |
| abstract_inverted_index.designed. | 143 |
| abstract_inverted_index.durations | 41, 102 |
| abstract_inverted_index.matching, | 87 |
| abstract_inverted_index.pressure, | 85 |
| abstract_inverted_index.schedule, | 29 |
| abstract_inverted_index.sequence, | 79 |
| abstract_inverted_index.settings. | 16 |
| abstract_inverted_index.artificial | 139 |
| abstract_inverted_index.comparison | 146 |
| abstract_inverted_index.completion | 82 |
| abstract_inverted_index.complexity | 76 |
| abstract_inverted_index.durations, | 70 |
| abstract_inverted_index.functions, | 132 |
| abstract_inverted_index.inaccurate | 12 |
| abstract_inverted_index.infinitely | 54 |
| abstract_inverted_index.acceptable. | 167 |
| abstract_inverted_index.assignments | 46, 105 |
| abstract_inverted_index.experiments | 169 |
| abstract_inverted_index.interaction | 99 |
| abstract_inverted_index.lower-level | 96 |
| abstract_inverted_index.management, | 200 |
| abstract_inverted_index.orientation | 65 |
| abstract_inverted_index.upper-level | 94 |
| abstract_inverted_index.consumption, | 89 |
| abstract_inverted_index.mathematical | 121 |
| abstract_inverted_index.optimization | 189 |
| abstract_inverted_index.programming, | 126 |
| abstract_inverted_index.adjustability | 67 |
| abstract_inverted_index.corresponding | 44 |
| abstract_inverted_index.nonlinearity, | 127 |
| abstract_inverted_index.synchronously | 47 |
| abstract_inverted_index.considerations | 118 |
| abstract_inverted_index.characteristics | 123 |
| cited_by_percentile_year.max | 96 |
| cited_by_percentile_year.min | 94 |
| corresponding_author_ids | https://openalex.org/A5100461199 |
| countries_distinct_count | 1 |
| institutions_distinct_count | 4 |
| corresponding_institution_ids | https://openalex.org/I43313876 |
| sustainable_development_goals[0].id | https://metadata.un.org/sdg/7 |
| sustainable_development_goals[0].score | 0.8899999856948853 |
| sustainable_development_goals[0].display_name | Affordable and clean energy |
| citation_normalized_percentile.value | 0.67668883 |
| citation_normalized_percentile.is_in_top_1_percent | False |
| citation_normalized_percentile.is_in_top_10_percent | False |