• Home
  • Search
  • Studies on optimization problems with dynamically arriving information
  • https://doi.org/10.48676/unibo/amsdottorato/12266Copy DOI Icon

Studies on optimization problems with dynamically arriving information

  • Abstract
  • Literature Map
  • Similar Papers
Abstract

In real-time environments like transportation planning, e-commerce, smart manufacturing, or emergency services, dynamically arriving information must be integrated on-the-fly into decision-making. This dissertation proposes effective online algorithms using classical and innovative analytical and computational evaluation methods, performance bounds, and comparisons to optimal solutions. It focuses on two dynamic optimization problems: the Online Order Batching, Sequencing, and picker Routing Problem(OOBSRP) in warehousing and the Traveling Salesman Problem with a Truck and a Drone under Incomplete Information(TSP-DI), for disaster relief. For the OOBSRP with manual and robotic carts, we prove that Reopt is asymptotically optimal with probability one under broad stochastic conditions. From a worst-case perspective, no policy can improve Reopt by more than 50%, as we show its asymptotical two-competitiveness. A computational study validates Reopt’s small gaps to the complete-information optimum (e.g. averaging at most 5% for a cost-minimization objective). A pattern analysis of Complete-Information Optimal Solutions (CIOSs), generated with dynamic programming algorithms, identifies simple algorithmic enhancements – like eliminating waiting, intervention, or strategic relocation – that further reduce costs and delivery times. These findings suggest limited benefits of anticipatory (including AI-based) algorithms in OOBSRP. Conversely, for TSP-DI with dynamically revealing road blockages, we prove that Reopt performs poorly in the worst case, with an exponentially growing competitive ratio. We propose policies delaying deliveries for drone surveillance that are significantly superior in competitive ratio and average results. Scheduling replenishment of battery-limited drones introduces a challenging static subproblem within these policies, which we address with a novel Very Large-Scale Neighborhood Search(VLNS) and an exact method. VLNS efficiently explores exponential-sized neighborhoods in polynomial runtime, making it an attractive subroutine for online policies and metaheuristics. This dissertation underscores the importance of analytical guarantees and comparisons to optima in online algorithm design, as policy effectiveness often diverges from intuition and varies significantly across problems.

Similar Papers
  • Research Article
  • Citations28

Optimization-Based Very Large-Scale Neighborhood Search for Generalized Assignment Problems with Location/Allocation Considerations

  • Jul 01, 2016
  • INFORMS Journal on Computing
  • Ahmed Ghoniem +2
  • Research Article
  • Citations41

Mathematical programming modeling for joint order batching, sequencing and picker routing problems in manual order picking systems

  • Feb 22, 2019
  • Journal of King Saud University - Engineering Sciences
  • Jose Alejandro Cano +2
  • Research Article
  • Citations55

Constrained Weapon–Target Assignment: Enhanced Very Large Scale Neighborhood Search Algorithm

  • Jan 01, 2010
  • IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans
  • Mei-Zi Lee
  • Research Article
  • Citations2

A new approach to the joint order batching and picker routing problem with alternative locations

  • Aug 22, 2023
  • IMA Journal of Management Mathematics
  • Sajjad Hedayati +3
  • Book Chapter
  • Citations104

Deep Policy Dynamic Programming for Vehicle Routing Problems

  • Jan 01, 2022
  • Wouter Kool +3
  • Conference Article
  • Citations5

Autonomous Shopping Cart: A New Concept of Service Robot for Assisting Customers

  • Nov 01, 2018
  • Raulcezar Alves +2
  • Conference Article
  • Citations12

The Algorithm of Terminal Logistics Path Planning Based on TSP Problem

  • Oct 01, 2020
  • Kaixin Shi +3
  • Research Article
  • Citations18

An Optimized Algorithm of Numerical Cutting-Path Control in Garment Manufacturing

  • Sep 01, 2013
  • Advanced Materials Research
  • Jing Ye +1
  • Conference Article

Synchronous Parallel Heuristics for Solving the Joint Order Batching and Picker Routing Problem

  • Jun 30, 2024
  • Son Thai Tran +3
  • Conference Article
  • Citations3

Skill-Based Joint Order Batching and Picker Routing Problem

  • Jan 12, 2022
  • Jafar Jamal +6
  • Conference Article
  • Citations10

Improved Particle Swarm Optimization For Traveling Salesman Problem

  • May 27, 2013
  • Xinli Xu +4
  • Book Chapter
  • Citations15

Distributed Transactional Contention Management as the Traveling Salesman Problem

  • Jan 01, 2014
  • Bo Zhang +2
  • Research Article
  • Citations7

Adversarial Deep Learning for Online Resource Allocation

  • Dec 31, 2021
  • ACM Transactions on Modeling and Performance Evaluation of Computing Systems
  • Bingqian Du +2
  • Single Report
  • Citations18

Special Cases of the Quadratic Assignment Problem

  • Apr 01, 1976
  • Nicos Christofides +1
  • Research Article
  • Citations12

Dynamic feedback Stackelberg games with non-unique solutions

  • Jul 26, 2007
  • Nonlinear Analysis
  • Pu-Yan Nie +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.