Showing papers by "Silvano Martello published in 2018"
TL;DR: A library of computer codes, benchmark instances, and pointers to relevant articles for bin packing and cutting stock problems is presented and the results of new computational experiments on a number of computer code and benchmark instances are reported.
Abstract: The bin packing problem (and its variant, the cutting stock problem) is among the most intensively studied combinatorial optimization problems. We present a library of computer codes, benchmark instances, and pointers to relevant articles for these two problems. The library is available at http://or.dei.unibo.it/library/bpplib
. The computer code section includes twelve programs: seven are directly downloadable from the library page, while for the remaining five we provide addresses where they can be obtained or downloaded. Some of the codes for which we provide an original C++ implementation need an integer linear programming solver. For such cases, the library provides two versions: one that uses the commercial solver CPLEX, and one that uses the freeware solver SCIP. The benchmark section provides over six thousands instances (partly coming from the literature and partly randomly generated), together with the corresponding solutions. Instances that are difficult to solve to proven optimality are included. The library also includes a BibTeX file of more than 150 references on this topic and an interactive visual tool to manually solve bin packing and cutting stock instances. We conclude this work by reporting the results of new computational experiments on a number of computer codes and benchmark instances.
47 citations
TL;DR: A new generalization of the traveling salesman problem with pickup and delivery, that stems from applications in maritime logistics, in which each node represents a port and has a known draft limit, is introduced.
Abstract: We introduce a new generalization of the traveling salesman problem with pickup and delivery, that stems from applications in maritime logistics, in which each node represents a port and has a known draft limit. Each customer has a demand, characterized by a weight, and pickups and deliveries are performed by a single ship of given weight capacity. The ship is able to visit a port only if the amount of cargo it carries is compatible with the draft limit of the port. We present an integer linear programming formulation and we show how classical valid inequalities from the literature can be adapted to the considered problem. We introduce heuristic procedures and a branch-and-cut exact algorithm. We examine, through extensive computational experiments, the impact of the various cuts and the performance of the proposed algorithms.
25 citations
TL;DR: This work computationally examines two heuristic methods: a fixed-scenario approach and a dual substitution algorithm and introduces a more sophisticated algorithm that incorporates various methodologies, including Lagrangian relaxation and variable fixing, which performs satisfactorily on benchmark instances.
19 citations
TL;DR: Computational comparisons with exact and heuristic methods for general non-convex mixed integer non-linear programs show that the proposed approach provides good-quality solutions within small computing times.
9 citations
TL;DR: This issue introduces the series of Annals of Operations Research issues that collects updated versions of the invited surveys that appeared in the journal 4OR: A Quarterly Journal of operations Research.
Abstract: We introduce the series of Annals of Operations Research issues that collects updated versions of the invited surveys that appeared in the journal 4OR: A Quarterly Journal of Operations Research.
6 citations
4 citations
TL;DR: This is the traditional triennial note used by the editors to give the readers of 4OR information on the state of the journal and its future.
Abstract: This is the traditional triennial note used by the editors to give the readers of 4OR information on the state of the journal and its future. In the 3 years that have passed since the last editorial note (Liberti et al. in Q J Oper 13:1–13, 2015), three volumes (each containing four issues) of the journal have been published: vol. 13 (2015), vol. 14 (2016), and vol. 15 (2017).
4 citations