On scheduling using optimizing SMT-solvers.
Among the problems that companies have to deal with is the vehicle routing problem (VRP), which is the problem of scheduling routes for vehicles to serve customers according to predetermined specifications, such as arrival time at a customer, amount of goods to deliver, etc. The problem is industrially relevant since material needs to be delivered from warehouses to the production lines and as the plants grow in size, managing an ever growing fleet of vehicles is becoming a challenge.
Due to the complexity of the requirements and the increasing size of the transportation systems, it is no longer feasible to solve these problems manually, since the variables and constraints to keep into account are simply to many. Modern computers can provide feasible schedules much faster than human beings and for this reason companies are willing to pay a high fee to use the cutting edge scheduling solvers on the market.
Among the class of general purpose solvers, we find mixed integer linear programming (MILP) solvers and satisfiability modulo theory (SMT) solvers. They are not designed to solve one specific problem, but entire classes of problems. In particular, both MILP and SMT solvers can handle mixed integer linear models and, since the VRP can be described by a mixed integer linear model, both MILP and SMT qualify as suitable tools to deal with it.
Sabino Francesco Roselli
Chalmers, Elektroteknik, System- och reglerteknik, Automation
SMT solvers for flexible job-shop scheduling problems: A computational analysis
IEEE International Conference on Automation Science and Engineering,; Vol. 2019-August(2019)p. 673-678
Paper i proceeding
SMT Solvers for Job-Shop Scheduling Problems: Models Comparison and Performance Evaluation
IEEE International Conference on Automation Science and Engineering,; Vol. 2018-August(2018)p. 547-552
Paper i proceeding
Engineering Tool Chain for Efficient and Iterative Development of Smart Factories (ENTOC)
VINNOVA, 2016-09-01 -- 2019-08-31.
Robotteknik och automation
Annan elektroteknik och elektronik
Chalmers tekniska högskola
Opponent: Federico Pecora