Alessandro Hill

Alessandro Hill
California Polytechnic State University, San Luis Obispo | Cal Poly · Department of Industrial & Manufacturing Engineering

Professor

About

31
Publications
1,961
Reads
How we measure 'reads'
A 'read' is counted each time someone views a publication summary (such as the title, abstract, and list of authors), clicks on a figure, or views or downloads the full-text. Learn more
189
Citations
Citations since 2017
19 Research Items
158 Citations
2017201820192020202120222023051015202530
2017201820192020202120222023051015202530
2017201820192020202120222023051015202530
2017201820192020202120222023051015202530
Introduction
Alessandro Hill is an Assistant Professor of Operations Research at California Polytechnic State University. He specializes in combinatorial optimization and applications to networks and scheduling.

Publications

Publications (31)
Article
Full-text available
The class social network is a momentous factor when it comes to educational, personal and professional student success as well as achieving course learning outcomes. Students and teachers benefit from expanded network connectivity via augmented engagement, more inclusivity, and efficient diffusion of information. We present a novel method for posit...
Poster
Full-text available
Prospective students struggle with choosing a program that best fits their interests. Curriculum data is often provided as a list, making it hard to identify relationships between various courses and programs. This project takes a network-analytics approach to enhance university study program exploration. Extracted keywords from course description...
Article
We study novel solution methods for a class of network optimization problems that find application in strategic planning of telecommunication infrastructure. These directed network design models are used to compute centralized two-level networks under capacity constraints: Circuits on the inner level and directed trees in the periphery. We develop...
Article
Effective computational methods are important for practitioners and researchers working in strategic underground mine planning. We consider a class of problems that can be modeled as a resource-constrained project scheduling problem with optional activities; the objective maximizes net present value. We provide a computational review of math progra...
Preprint
The class social network is a momentous factor when it comes to educational, personal and professional student success as well as achieving course learning outcomes. Students and teachers benefit from expanded network connectivity via augmented engagement , more inclusivity, and efficient diffusion of information. We present a novel method for posi...
Article
Full-text available
In this work, we suggest concepts and solution methodologies for a series of strategic network design problems that find application in highly data-sensitive industries, such as, for instance, the high-tech, governmental, or military sector. Our focus is on the installation of widely used cost-efficient tree-structured communication infrastructure....
Article
The craft beer supply chain in the USA differs from the supply chain of macro breweries in its structure, handled volumes and product shelf-life. In this work, we study how these smaller craft breweries can benefit from transparency in their supply chain. We consider additional information sharing of orders and inventories at downstream nodes. The...
Chapter
It is well-known that experience can lead to increased efficiency, yet this is largely unaccounted for in project scheduling. We consider project scheduling problems where the duration of activities can be reduced when scheduled after certain other activities that allow for learning relevant skills. Since per-period availabilities of renewable reso...
Preprint
It is well-known that experience can lead to increased efficiency, yet this is largely unaccounted for in project scheduling. We con- sider project scheduling problems where the duration of activities can be reduced when scheduled after certain other activities that allow for learning relevant skills. Since per-period availabilities of renewable re...
Preprint
In this work, we suggest concepts and solution methodologies for a series of strategic network design problems that find application in highly data-sensitive industries, such as, for instance, the high-tech, governmental, or military sector. Our focus is on the installation of widely used cost-efficient tree-structured communication infrastructure....
Poster
Full-text available
We study payment policies in resource constrained projects from the contractor’s perspective. Contracts may differ in terms of planned payments. What different policies are there? How can contractors evaluate their payment policy options? How can contractors optimize their schedules in order to maximize profit? We introduce optimization models base...
Article
Full-text available
The ring-tree facility location problem is a generalization of the capacitated ring-tree problem in which additional cost and capacity related to facilities are considered. Applications of this problem arise in the strategic design of bi-level telecommunication networks. We investigate an extended integer programming formulation for the problem and...
Chapter
In this paper we propose two novel variants of the well-known Steiner tree problem in graphs that are motivated by applications in secure strategic telecommunication network design. Both network optimization models ask for a tree of minimal total edge cost that connects a pre-specified set of terminal nodes to a dedicated root node by optionally in...
Article
Full-text available
In this work, we introduce profit-oriented capacitated ring arborescence problems and present exact and heuristic algorithms. These combinatorial network design problems ask for optimized bi-level networks taking into account arc costs and node profits. Solutions combine circuits on the inner level with arborescences on the outer level of the netwo...
Article
Full-text available
In this paper, we address the waterway ship scheduling problem (WSSP), which finds applications in the management of ship arrivals and departures at maritime ports near channels and waterways. It incorporates practically relevant conflicts which stem from tidal changes, curfews, ship properties or traffic. We propose a reformulation of the WSSP as...
Article
We introduce bi-objective models for ring tree network design with a focus on network reliability within telecommunication applications. Our approaches generalize the capacitated ring tree problem (CRTP) which asks for a partially reliable topology that connects customers with different security requirements to a depot node by combined ring and tre...
Article
In this paper we present a heuristic framework that is based on mathematical programming to solve network design problems. Our techniques combine local branching with locally exact refinements. In an iterative strategy an existing solution is refined by sequentially solving restricted mixed integer programs (MIPs) to optimality. These are obtained...
Article
Full-text available
In this paper, we present an innovative decision support system that simultaneously provides predictive analytics to logistic nodes as well as to collaborating truck companies. Logistic nodes, such as container terminals, container depots or container loading facilities, face heavy workloads through a large number of truck arrivals during peak time...
Article
The Capacitated m-Ring-Star Problem (crsp) is the problem of designing a set of rings that pass through a central depot and through some transition points and/or customers, and then assigning each nonvisited customer to a visited point or customer. The number of customers visited and connected to a ring is bounded by an upper limit: the capacity of...
Article
The ubiquitous interest in networks per se stems from their natural appearance in countless situations - real world kind as well as theoretical. Network models can be used to describe infrastructure, processes, and relations in general. Furthermore, the cost-driven evaluation of networks leads to the question of how to effciently construct networks...
Article
In the multi-depot ring star problem (MDRSP), a set of customers has to be connected to a set of given depots by ring stars. Such a ring star is a cycle graph, also called a ring, with some additional nodes assigned to its nodes by single star edges. Optional Steiner nodes can be used in the network as intermediate nodes on the rings. Depot depende...
Article
In this work we discuss a facility location variant of the capacitated ring tree problem. The new model generalizes vehicle routing problems and Steiner tree problems, yielding applicability in telecommunication and transportation networks. In this ring tree facility location problem (RTFLP) two layers of networks have to be designed to connect two...
Poster
Highlights: -We suggest a flexible decision support system in order to simultaneously reduce truck wait times and peak work loads at logistic nodes -We study artificial intelligence based forecasting methods for predicting arrival rates and wait times under consideration of predictor information -Development of a prototype using real-world data fro...
Poster
Highlights: -A generic framework for heuristic network design, based on generalized local branching (GLB) -An efficient MIP heuristic for the Capacitated Ring Tree Problem yielding high quality results
Article
We study a new network design model combining ring and tree structures under capacity constraints. The solution topology of this capacitated ring tree problem (CRTP) is based on ring trees which are the union of trees and 1-trees. The objective is the minimization of edge costs but could also incorporate other types of measures. This overall proble...
Conference Paper
A ring tree is a tree graph with an optional additional edge that closes a unique cycle. Such a cycle is called a ring and the nodes on it are called ring nodes. The capacitated ring tree problem (CRTP) asks for a network of minimal overall edge cost that connects given customers to a depot by ring trees. Ring trees are required to intersect in the...
Conference Paper
We apply a greedy randomized adaptive search procedure (GRASP) to solve the connected facility location problem heuristically. Diversification property is assured by applying a randomized greedy algorithm to construct feasible solutions in a multi-start fashion. Intensification elements are guaranteed due to two facility-based local search techniqu...

Network

Cited By