-
University of New South Wales
- Canberra, Australia
- https://sites.google.com/view/setyotw
-
EVDRP_instances Public
Dataset of problem instances for electric vehicle-drone routing problem, used in Mara et al. (2023).
-
A simple simulated annealing algorithm with three different neighborhood moves for solving traveling salesman problem
-
GeneticAlgorithm_TSP_Julia Public
A simple genetic algorithm for solving traveling salesman problem
-
Dataset of problem instances for job sequencing and tool switching problem with sequence-dependent setup times, used in Mara et al. (2021) and Rifai et al. (2022).
Creative Commons Zero v1.0 Universal UpdatedSep 5, 2022 -
VRPTWD_instances Public
Dataset of problem instances for vehicle routing problem with drones and time windows, used in Kuo et al. (2022).
-
daSilva2020_UniformSSP_JuMP Public
A code for solving a case of job sequencing and tool switching problem (SSP) with uniform setup time, using a multicommodity flow formulation from da Silva, Chaves, and Yanasse (2020). Written in J…
Julia MIT License UpdatedSep 2, 2022 -
A code for solving a case of job sequencing and tool switching problem (SSP) with uniform setup time, using a mathematical formulation from Catanzaro, Gouviea, and Labbe (2015). Written in Julia an…
Julia MIT License UpdatedSep 2, 2022 -
Laporte2004_UniformSSP_JuMP Public
A code for solving a case of job sequencing and tool switching problem (SSP) with uniform setup time, using a mathematical formulation from Laporte, Salazar-Gonzales, and Semet (2004). Written in J…
Julia MIT License UpdatedSep 2, 2022 -
A code for solving a case of job sequencing and tool switching problem (SSP) with uniform setup time, using a mathematical formulation from Tang and Denardo (1988). Written in Julia and JuMP, solve…
Julia MIT License UpdatedSep 2, 2022 -
MTZ_Formulation_TSP_Pyomo Public
An implementation of Miller-Tucker-Zemlin formulation for traveling salesman problem, written in Pyomo and solved with Gurobi.
-
DFJ_Formulation_TSP_Pyomo Public
An implementation of Dantzig-Fulkerson-Johnson formulation for traveling salesman problem, written in Pyomo and solved with Gurobi.