Meta Heuristics

Adjustable robust optimization for fleet sizing problem in closed-loop supply chains with simultaneous delivery and pickup

  • Ali Borumand
  • Ali Nookabadi
    • Categories (Mixed) Integer Linear Programming, Meta Heuristics, Robust Optimization Tags , , , ,

    The Fleet Sizing Problem (FSP) stands as a critical challenge within the realm of logistics and supply chain management, particularly in the context of Closed-Loop Supply Chains (CLSC). The significance of addressing the FSP lies in its direct impact on operational costs, resource utilization, and environmental sustainability. By effectively optimizing fleet size, organizations can streamline … Read more

    Optimization Over Trained Neural Networks: Taking a Relaxing Walk

  • Jiatai Tong
  • Junyang Cai
  • Thiago Serra
    • Categories (Mixed) Integer Linear Programming, Data-Mining, Meta Heuristics

    Besides training, mathematical optimization is also used in deep learning to model and solve formulations over trained neural networks for purposes such as verification, compression, and optimization with learned constraints. However, solving these formulations soon becomes difficult as the network size grows due to the weak linear relaxation and dense constraint matrix. We have seen … Read more

    Exact Solutions for the NP-hard Wasserstein Barycenter Problem using a Doubly Nonnegative Relaxation and a Splitting Method

  • Woosuk L. Jung
  • Walaa M. Moursi
  • Henry Wolkowicz
    • Categories Combinatorial Optimization, Meta Heuristics, Semi-definite Programming

    \(\) The simplified Wasserstein barycenter problem consists in selecting one point from \(k\) given sets, each set consisting of \(n\) points, with the aim of minimizing the sum of distances to the barycenter of the \(k\) points chosen. This problem is known to be NP-hard. We compute the Wasserstein barycenter by exploiting the Euclidean distance … Read more

    A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery

  • Kamyla Ferreira
  • Thiago Alves de Queiroz
  • Pedro Munari
  • Franklina M. B. Toledo
    • Categories Meta Heuristics, Production and Logistics, Transportation Tags , , , ,

    \(\) We address the Green Vehicle Routing Problem with Two-Dimensional Loading Constraints and Split Delivery (G2L-SDVRP), which extends the split delivery vehicle routing problem to include customer demands represented by two-dimensional, rectangular items. We aim to minimize carbon dioxide (CO\(_2\)) emissions instead of travel distance, a critical issue in contemporary logistics activities. The CO\(_2\) emission … Read more

    An Efficient Pixel-based Packing Algorithm for Additive Manufacturing Production Planning

  • Hu Kanxin
    • Categories Meta Heuristics, Production and Logistics, Scheduling Tags , , ,

    Additive Manufacturing (AM), the technology of rapid prototyping directly from 3D digital models, has made a significant impact on both academia and industry. When facing the growing demand of AM services, AM production planning (AMPP) plays a vital role in reducing makespan and costs for AM service companies. This research focuses on the AMPP problem … Read more

    Minimizing earliness-tardiness costs in supplier networks – A Just-in-time Truck Routing Problem

  • Julian Baals
  • Simon Emde
  • Turkensteen Marcel
    • Categories Meta Heuristics, Production and Logistics Tags , , , ,

    We consider a routing problem where orders are transported just-in-time from several suppliers to an original equipment manufacturer (OEM). This implies that shipments cannot be picked up before their release date when they are ready at the supplier and should be delivered as close as possible to their due date to the OEM. Every shipment … Read more

    The Combinatorial Brain Surgeon: Pruning Weights That Cancel One Another in Neural Networks

  • Xin Yu
  • Thiago Serra
  • Shandian Zhe
  • Srikumar Ramalingam
    • Categories Data-Mining, Meta Heuristics, Quadratic Programming Tags , ,

    Neural networks tend to achieve better accuracy with training if they are larger — even if the resulting models are overparameterized. Nevertheless, carefully removing such excess parameters before, during, or after training may also produce models with similar or even improved accuracy. In many cases, that can be curiously achieved by heuristics as simple as … Read more

    Heuristic approaches for split delivery vehicle routing problems

  • Aldair Álvarez
  • Pedro Munari
    • Categories Branch and Cut Algorithms, Meta Heuristics, Transportation Tags , , , ,

    We propose a matheuristic approach to solve split delivery variants of the vehicle routing problem (VRP). The proposed method is based on the use of several mathematical programming components within an Iterated Local Search metaheuristic framework. In addition to well-known VRP local search heuristics, we include new types of improvement and perturbation strategies that are … Read more

    An Efficient Tabu Search Algorithm for the Tool Indexing Problem

  • Deepti Mohan
  • Diptesh Ghosh
    • Categories Meta Heuristics, Production and Logistics Tags , , ,

    In this paper, we look at the tool indexing problem in which a single copy of each tool is allowed in the tool magazine. We develop problem specific methods to search the neighborhood efficiently and design a Tabu Search algorithm based on them. Computational experiments show that our algorithm is competent. Citation Indian Institute of … Read more