We define the \emph{adjacent vertex distinguishing sum edge coloring problem}. This problem consists in finding an assignment of colors to the edges of a graph with the following constraints: every pair of adjacent edges must have a different color, and every pair of adjacent vertices must not...

This paper studies an extension of the rural postman problem with multiple depots and rechargeable and reusable vehicles capable of multiple trips with capacity constraints. This paper presents a new Mixed Integer Linear Programming (MILP) formulation to find optimal solutions to the problem....

This paper presents two heuristic algorithms for the distance-based critical node problem (DCNP) that finds k nodes whose removalminimizes the pairwise connection within D hops in the remaining network. The structural properties of complex networks havenot yet been extensively addressed in the...

The necessity for extensive historical data, variables, and weight determination still presents challenges and complexity, notwithstanding the growth in research on socio-ecological vulnerability to climate change. In order to fill in these gaps, this study uses China’s Fujian Province as a...

We consider a competitive facility location model with uncertain customers’ parameters. The model is built on the base of a Stackelberg game framework where competing parties (the Leader and the Follower) sequentially decide on opening their facilities. In the model, the Leader does not have a...

In this paper, we study the capacitated multi-trip vehicle routing problem with time windows (CMTVRPTW) and its use in different scenarios, which have a common feature: vehicles can make multiple trips. This feature is widely used in the real world; not only can it reduce the number of vehicles...

We investigate the problem of $k$-submodular maximization under a knapsack constraint over the ground set of size $n$. This problem finds many applications in various fields such as multi-topic propagation, multi-sensor placement, cooperative games, etc. However, existing algorithms for the...

The traffic assignment problem (TAP) with nonadditive path cost can only be solved by path-based algorithms owing to the characteristics of its cost structure. These algorithms generally decompose the TAP into subproblems with path flow as the variable by OD pairs and solve them sequentially. In...

This study deals with the scheduling problem to minimize makespan at a wet clean station in semiconductor fabrication. The wet clean station is comprised of sequential chemical and rinsing baths for cleaning wafer lots and multiple robot arms for lot handling. In the station, wafer lots are...