Open Access. Powered by Scholars. Published by Universities.®

Operations Research, Systems Engineering and Industrial Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 6 of 6

Full-Text Articles in Operations Research, Systems Engineering and Industrial Engineering

Combinatorial Auction For Transportation Matching Service: Formulation And Adaptive Large Neighborhood Search Heuristic, Baoxiang Li, Hoong Chuin Lau Oct 2017

Combinatorial Auction For Transportation Matching Service: Formulation And Adaptive Large Neighborhood Search Heuristic, Baoxiang Li, Hoong Chuin Lau

Research Collection School Of Information Systems

This paper considers the problem of matching multiple shippers and multi-transporters for pickups and drop-offs, where the goal is to select a subset of group jobs (shipper bids) that maximizes profit. This is the underlying winner determination problem in an online auction-based vehicle sharing platform that matches transportation demand and supply, particularly in a B2B last-mile setting. Each shipper bid contains multiple jobs, and each job has a weight, volume, pickup location, delivery location and time window. On the other hand, each transporter bid specifies the vehicle capacity, available time periods, and a cost structure. This double-sided auction will be ...


Distributed Route Planning And Scheduling Via Hybrid Conflict Resolution, Ramesh Thangarajoo, Hoong Chuin Lau Aug 2010

Distributed Route Planning And Scheduling Via Hybrid Conflict Resolution, Ramesh Thangarajoo, Hoong Chuin Lau

Research Collection School Of Information Systems

In this paper, we discuss the problem of route planning and scheduling by a group of agents. Each agent is responsible for designing a route plan and schedule over a geographical network, and the goal is to obtain a conflict-free plan/schedule that optimizes a global objective. We present a hybrid conflict resolution method that involves coalition formation and distributed constraint satisfaction depending on the level of coupling between agents. We show how this approach can be effectively applied to solve a distributed convoy movement planning problem.


Ethnic-Identity Intensity As A Moderator Of The Technology Acceptance Model And Its Antecedents, Marcus Anthony Alexander Jan 2008

Ethnic-Identity Intensity As A Moderator Of The Technology Acceptance Model And Its Antecedents, Marcus Anthony Alexander

Retrospective Theses and Dissertations

The goal of this dissertation is oriented to study the motivation of minorities to adopt and learn new, innovative technologies. The primary research question: is there some reason the African-American experience is driving certain sub-groups of the population to the wrong side of the digital divide? To examine this, I introduce ethnic identity as a moderating variable to a leftward extended technology acceptance model (TAM). Additionally, both components of the classic TAM (ease of use and usefulness) are divided into two antecedents: (1) ease of use - (a) trait efficacy and (b) state efficacy and (2) usefulness (completely replaced by) - (a ...


Finding A Length-Constrained Maximum-Sum Or Maximum-Density Subtree And Its Application To Logistics, Hoong Chuin Lau, Trung Hieu Ngo, Bao Nguyen Nguyen Dec 2006

Finding A Length-Constrained Maximum-Sum Or Maximum-Density Subtree And Its Application To Logistics, Hoong Chuin Lau, Trung Hieu Ngo, Bao Nguyen Nguyen

Research Collection School Of Information Systems

We study the problem of finding a length-constrained maximum-density path in a tree with weight and length on each edge. This problem was proposed in [R.R. Lin, W.H. Kuo, K.M. Chao, Finding a length-constrained maximum-density path in a tree, Journal of Combinatorial Optimization 9 (2005) 147–156] and solved in O(nU) time when the edge lengths are positive integers, where n is the number of nodes in the tree and U is the length upper bound of the path. We present an algorithm that runs in O(nlog2n) time for the generalized case when the edge ...


Multi-Period Multi-Dimensional Knapsack Problem And Its Application To Available-To-Promise, Hoong Chuin Lau, M. K. Lim May 2004

Multi-Period Multi-Dimensional Knapsack Problem And Its Application To Available-To-Promise, Hoong Chuin Lau, M. K. Lim

Research Collection School Of Information Systems

This paper is motivated by a recent trend in logistics scheduling, called Available-to-Promise. We model this problem as the multi-period multi-dimensional knapsack problem. We provide some properties for a special case of a single-dimensional problem. Based on insights obtained from these properties, we propose a two-phase heuristics for solving the multi-dimensional problem. We also propose a novel time-based ant colony optimization algorithm. The quality of the solutions generated is verified through experiments, where we demonstrate that the computational time is superior compared with integer programming to achieve solutions that are within a small percentage of the upper bounds.


Logistics Outsourcing And 3pl Challenges, Michelle Lee Fong Cheong Jan 2004

Logistics Outsourcing And 3pl Challenges, Michelle Lee Fong Cheong

Research Collection School Of Information Systems

Logistics has been an important part of every economy and every business entity. The worldwide trend in globalization has led to many companies outsourcing their logistics function to Third-Party Logistics (3PL) companies, so as to focus on their core competencies. This paper attempts to broadly identify and categorize the challenges faced by 3PL companies and discover potential gaps for future research. Some of the challenges will be related with the experience and information collected from interviews with two 3PL companies.