Abstract: Small to medium sized transportation and logistics companies are usually constrained by limited computing and IT professional resources on implementing an efficient parallel metaheuristic ...
Long before anyone had built a machine capable of holding a real conversation, Alan Turing was already asking what would ...
pt_tmp=pd.read_excel("JSP_dataset.xlsx",sheet_name="Processing Time",index_col =[0]) ms_tmp=pd.read_excel("JSP_dataset.xlsx",sheet_name="Machines Sequence",index_col ...
Abstract: Selection of dispatching modes for a transit system is a very important aspect of the schedule problem. This paper aims to optimize and monitor the scheduling and dispatching of public ...
We use heuristics to solve computationally difficult problems where optimal solutions are too expensive to deploy, hard to manage, or otherwise inefficient. Our prior work, MetaOpt, shows many of the ...
This document has been published in the Federal Register. Use the PDF linked in the document sidebar for the official electronic format.
Finding bipartite matchings is one of the oldest and most well-studied problems in computer science. This problem comes up in many guises, such as when matching donors to recipients for organ ...
Optimization of Steelmaking Energy Efficiency Scheduling Based on an Equipment Set Shutdown Strategy
Creative Commons (CC): This is a Creative Commons license. Attribution (BY): Credit must be given to the creator. Non-Commercial (NC): Only non-commercial uses of the work are permitted. The steel ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results