{"id":"https://openalex.org/W7154590630","doi":"https://doi.org/10.48550/arxiv.2604.13385","title":"On the Use of Evolutionary Optimization for the Dynamic Chance Constrained Open-Pit Mine Scheduling Problem","display_name":"On the Use of Evolutionary Optimization for the Dynamic Chance Constrained Open-Pit Mine Scheduling Problem","publication_year":2026,"publication_date":"2026-04-15","ids":{"openalex":"https://openalex.org/W7154590630","doi":"https://doi.org/10.48550/arxiv.2604.13385"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.13385","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.13385","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.13385","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5095335145","display_name":"Ishara Hewa Pathiranage","orcid":"https://orcid.org/0000-0002-8043-994X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Pathiranage, Ishara Hewa","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5001757263","display_name":"Aneta Neumann","orcid":"https://orcid.org/0000-0002-0036-4782"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Neumann, Aneta","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/T13065","display_name":"Mining Techniques and Economics","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T13065","display_name":"Mining Techniques and Economics","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T12177","display_name":"Resource-Constrained Project Scheduling","score":0.0015999999595806003,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T13341","display_name":"Belt Conveyor Systems Engineering","score":0.0007999999797903001,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical 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/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.5940999984741211},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.499099999666214},{"id":"https://openalex.org/keywords/baseline","display_name":"Baseline (sea)","score":0.49790000915527344},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.47209998965263367},{"id":"https://openalex.org/keywords/profit","display_name":"Profit (economics)","score":0.383899986743927},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.35679998993873596},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.3240000009536743}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.676800012588501},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.5940999984741211},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5860000252723694},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.499099999666214},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.49790000915527344},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.47209998965263367},{"id":"https://openalex.org/C181622380","wikidata":"https://www.wikidata.org/wiki/Q26911","display_name":"Profit (economics)","level":2,"score":0.383899986743927},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.35679998993873596},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.3240000009536743},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.296099990606308},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.29409998655319214},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.28780001401901245},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.27790001034736633},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.27070000767707825},{"id":"https://openalex.org/C121835503","wikidata":"https://www.wikidata.org/wiki/Q2596288","display_name":"Evolutionary programming","level":3,"score":0.2621000111103058}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.13385","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.13385","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.13385","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.13385","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":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.5688346028327942}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Open-pit":[0],"mine":[1,60],"scheduling":[2,61],"is":[3,121],"a":[4,56,80,101,108,119,139],"complex":[5],"real":[6],"world":[7],"optimization":[8],"problem":[9,62],"that":[10,84,106,151],"involves":[11],"uncertain":[12,34],"economic":[13,66],"values":[14,67],"and":[15,35,40,70,72,90,113,135,164],"dynamically":[16],"changing":[17,36],"resource":[18],"capacities.":[19],"Evolutionary":[20],"algorithms":[21,134],"are":[22,43,68],"particularly":[23],"effective":[24],"in":[25,46,48,63],"these":[26],"scenarios,":[27],"as":[28],"they":[29],"can":[30],"easily":[31],"adapt":[32],"to":[33],"environments.":[37],"However,":[38],"uncertainty":[39,162],"dynamic":[41,57,97],"changes":[42],"often":[44],"studied":[45],"isolation":[47],"real-world":[49],"problems.":[50],"In":[51],"this":[52,128],"paper,":[53],"we":[54,99],"study":[55],"chance-constrained":[58],"open-pit":[59],"which":[64],"block":[65],"stochastic":[69],"mining":[71,148],"processing":[73],"capacities":[74],"vary":[75],"over":[76],"time.":[77],"We":[78,123],"adopt":[79],"bi-objective":[81],"evolutionary":[82,133],"formulation":[83],"simultaneously":[85],"maximizes":[86],"expected":[87],"discounted":[88],"profit":[89],"minimizes":[91],"its":[92],"standard":[93],"deviation.":[94],"To":[95],"address":[96],"changes,":[98],"propose":[100],"diversity-based":[102],"change":[103,120,165],"response":[104],"mechanism":[105,129],"repairs":[107],"subset":[109],"of":[110,127],"infeasible":[111],"solutions":[112,117],"introduces":[114],"additional":[115],"feasible":[116],"whenever":[118],"detected.":[122],"evaluate":[124],"the":[125,152,157],"effectiveness":[126],"across":[130,160],"four":[131],"multi-objective":[132],"compare":[136],"it":[137],"with":[138],"baseline":[140,158],"re-evaluation-based":[141],"change-response":[142],"strategy.":[143],"Experimental":[144],"results":[145],"on":[146],"six":[147],"instances":[149],"demonstrate":[150],"proposed":[153],"approach":[154],"consistently":[155],"outperforms":[156],"methods":[159],"different":[161],"levels":[163],"frequencies.":[166]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-17T00:00:00"}