S CHEDULE N ET : L EARN TO S OLVE M IN M AX M ULTIPLE T RAVELLING S ALESMAN P ROBLEM
Anonymous authors
Paper under double-blind review
A BSTRACT
There has been continuous effort to learn to solve famous CO problems such as
Traveling Salesman Problem (TSP) and Vehicle Routing Problem (VRP) using reinforcement learning (RL).
Although they have shown good optimality and computational efﬁciency, these approaches have been limited to scheduling a singlevehicle.
MinMax mTSP, the focus of this study, is the problem seeking to minimize the total completion time for multiple workers to complete the geographically distributed tasks.
Solving MinMax mTSP using RL raises signiﬁcant challenges because one needs to train a distributed scheduling policy inducing the cooperative strategic routings using only the single delayed and sparse reward signal (makespan).
In this study, we propose the ScheduleNet that can solve mTSP with any numbers of salesmen and cities.
The ScheduleNet presents a state (partial solution to mTSP) as a set of graphs and employs type aware graph node embeddings for deriving the cooperative and transferable scheduling policy.
Additionally, to effectively train the ScheduleNet with sparse and delayed reward (makespan), we propose an RL training scheme, Clipped REINFORCE with ”target net,” which signiﬁcantly stabilizes the training and improves the generalization performance.
We have empirically shown that the proposed method achieves the performance comparable to Google OR-Tools, a highly optimized meta-heuristic baseline.
I NTRODUCTION
There have been numerous approaches to solve combinatorial optimization (CO) problems using machine learning.
Bengio et al.
(2020) have categorized these approaches into demonstration and experience .
In demonstration setting, supervised learning has been employed to mimic the behavior of the existing expert (e.g., exact solvers or heuristics).
On the other hand, in the experience setting, typically, reinforcement learning (RL) has been employed to learn a parameterized policy that can solve newly given target problems without direct supervision.
While the demonstration policy cannot outperform its guiding expert, RL-based policy can outperform the expert because it improves its policy using a reward signal.
Concurrently, Mazyavkina et al.
(2020) have further categorized the RL approaches into improvement and construction heuristics.
An improvement heuristics start from the arbitrary (complete) solution of the CO problem and iteratively improve it with the learned policy until the improvement stops (Chen & Tian, 2019; Ahn et al., 2019).
On the other hand, the construction heuristics start from the empty solution and incrementally extend the partial solution using a learned sequential decision-making policy until it becomes complete.
There has been continuous effort to learn to solve famous CO problems such as Traveling Salesman
Problem (TSP) and Vehicle Routing Problem (VRP) using RL-based construction heuristics (Bello et al., 2016; Kool et al., 2018; Khalil et al., 2017; Nazari et al., 2018).
Although they have shown good optimality and computational efﬁciency performance, these approaches have been limited to only scheduling a single-vehicle.
The multi -extensions of these routing problems, such as multiple
TSP and multiple VRP, are underrepresented in the deep learning research community, even though they capture a broader set of the real-world problems and pose a more signiﬁcant scientiﬁc challenge.
The multiple traveling salesmen problem (mTSP) aims to determine a set of subroutes for each salesman, given m salesmen and N cities that need to be visited by one of the salesmen, and a depot where salesmen are initially located and to which they return.
The objective of a mTSP is either minimizing the sum of subroute lengths ( MinSum ) or minimizing the length of the longest subroute
( MinMax ).
In general, the MinMax objective is more practical, as one seeks to visit all cities as soon as possible (i.e., total completion time minimization).
In contrast, the MinSum formulation, in general, leads to highly imbalanced solutions where one of the salesmen visits most of the cities, which results in longer total completion time (Lupoaie et al., 2019).
In this study, we propose a learning-based decentralized and sequential decision-making algorithm for solving Minmax mTSP problem; the trained policy, which is a construction heuristic, can be employed to solve mTSP instances with any numbers of salesman and cities.
Learning a transferable mTSP solver in a construction heuristic framework is signiﬁcantly challenging comparing to its single-agent variants (TSP and CVRP) because (1) we need to use the state representation that is ﬂexible enough to represent any arbitrary number of salesman and cities (2) we need to introduce the coordination among multiple agents to complete the geographically distributed tasks as quickly as possible using a sequential and decentralized decision making strategy and (3) we need to learn such decentralized cooperative policy using only a delayed and sparse reward signal, makespan, that is revealed only at the end of the episode.
To tackle such a challenging task, we formulate mTSP as a semi-MDP and derive a decentralized decision making policy in a multi-agent reinforcement learning framework using only a sparse and delayed episodic reward signal.
The major components of the proposed method and their importance are summarized as follows:
• Decentralized cooperative decision-making strategy: Decentralization of scheduling policy is essential to ensure the learned policy can be employed to schedule any size of mTSP problems in a scalable manner; decentralized policy maps local observation of each idle salesman one of feasible individual action while joint policy maps the global state to the joint scheduling actions.
• State representation using type-award graph attention (TGA): the proposed method represents a state (partial solution to mTSP) as a set of graphs, each of which captures speciﬁc relationships among works, cities, and a depot.
The proposed method then employs TGA to compute the node embeddings for all nodes (salesman and cities), which are used to assign idle salesman to an unvisited city sequentially.
• Training decentralized policy using a single delayed shared reward signal: Training decentralized cooperative strategy using a single sparse and delayed reward is extremely difﬁcult in that we need to distribute credits of a single scalar reward (makespan) over the time and agents.
To resolve this, we propose a stable MARL training scheme which signiﬁcantly stabilizes the training and improves the generalization performance.
We have empirically shown that the proposed method achieves the performance comparable to
Google OR-Tools, a highly optimized meta-heuristic baseline.
The proposed approach outperforms
OR-Tools in many cases on in-training, out-of-training problem distributions, and real-world problem instances.
We also veriﬁed that scheduleNet can provide an efﬁcient routing service to customers.
R ELATED W ORK
Construction RL approaches A seminal body of work focused on the construction approach in the
RL setting for solving CO problems (Bello et al., 2016; Nazari et al., 2018; Kool et al., 2018; Khalil et al., 2017).
These approaches utilize encoder-decoder architecture, that encodes the problem structure into a hidden embedding ﬁrst, and then autoregressively decodes the complete solution.
Bello et al.
(2016) utilized LSTM (Hochreiter & Schmidhuber, 1997) based encoder and decode the complete solution (tour) using Pointer Network (Vinyals et al., 2015) scheme.
Since the routing tasks are often represented as graphs, Nazari et al.
(2018) proposed an attention based encoder, while using LSTM decoder.
Recently, Kool et al.
(2018) proposed to use Transformer-like architecture (Vaswani et al., 2017) to solve several variants of TSP and single-vehicle CVRP.
On the contrary,
Khalil et al.
(2017) do not use encoder-decoder architecture, but a single graph embedding model, structure2vec (Dai et al., 2016), that embeds a partial solution of the TSP and outputs the next city in the (sub)tour.
(Kang et al., 2019) has extended structure2vec to random graph and employed this random graph embedding to solve identical parallel machine scheduling problems, the problem seeking to minimize the makespan by scheduling multiple machines.
Learned mTSP solvers
The machine learning approaches for solving mTSP date back to Hopﬁeld & Tank (1985).
However, these approaches require per problem instance training.
(Hopﬁeld &
Tank, 1985; Wacholder et al., 1989; Somhom et al., 1999).
Among the recent learning methods,
Kaempfer & Wolf (2018) encodes MinSum mTSP with a set-specialized variant of Transformer architecture that uses permutation invariant pooling layers.
To obtain the feasible solution, they use a combination of the softassign method Gold & Rangarajan (1996) and a beam search.
Their model is trained in a supervised setting using mTSP solutions obtained by Integer Linear Programming (ILP) solver.
Hu et al.
(2020) utilizes a GNN encoder and self-attention Vaswani et al.
(2017) policy outputs a probability of assignment to each salesman per city.
Once cities are assigned to speciﬁc salesmen, they use existing TSP solver, OR-Tools (Perron & Furnon), to obtain each worker’s subroutes.
Their method shows impressive scalability in terms of the number of cities, as they present results for mTSP instances with 1000 cities and ten workers.
However, the trained model is not scalable in terms of the number of workers and can only solve mTSP problems with a pre-speciﬁed, ﬁxed number of workers.
P ROBLEM FORMULATION
We deﬁne the set of m salesmen indexed by V T = { 1 , 2 , ..., m } , and the set of N cities indexed by V
C = { m + 1 , 2 , ..., m + N } .
Following mTSP conventions, we deﬁne the ﬁrst city as the depot.
We also deﬁne the 2D-coordinates of entities (salesmen, cities, and the depot) as p i .
The objective of
MinMax mTSP is to minimize the length of the longest subtour of salesmen, while subtours covers all cities and all subtours of salesmen end at the depot.
For the clarity of explanation, we will refer to salesman as a workers , and cities as a tasks .
3. MDP FORMULATION FOR M IN M AX M TSP
In this paper, the objective is to construct an optimal solution with a construction RL approach.
Thus, we cast the solution construction process of MinMax mTSP as a Markov decision process (MDP).
The components of the proposed MDP are as follows.
Transition The proposed MDP transits based on events .
We deﬁne an event as the the case where any worker reaches its assigned city.
We enumerate the event with the index τ for avoiding confusion from the elapsed time of the mTSP problem.
t ( τ ) is a function that returns the time of event τ .
In the proposed event-based transition setup, the state transitions coincide with the sequential expansion of the partial scheduling solution.
State Each entity i has its own state s iτ = (cid:16) p iτ , 1 active τ , 1 assigned τ (cid:17) at the τ -th event.
the coordinates p iτ is time-dependent for workers and static for tasks and the depot.
Indicator 1 active τ describes whether the entity is active or inactive
In case of tasks, inactive indicates that the task is already visited; in case of worker, inactive means that worker returned to the depot.
Similarly, 1 assigned τ indicates whether worker is assigned to a task or not.
We also deﬁne the environment state s env τ that contains the current time of the environment, and the sequence of tasks visited by each worker, i.e., partial solution of the mTSP.
The state s τ of the MDP at the τ -th event becomes s τ = (cid:0) { s iτ } m + N i
=1 , s env τ (cid:1) .
The ﬁrst state s 0 corresponds to the empty solution of the given problem instance, i.e., no cities have been visited, and all salesmen are in the depot.
The terminal state s T corresponds to a complete solution of the given mTSP instance, i.e., when every task has been visited, and every worker returned to the depot (See Figure 1).
Action A scheduling action a τ is deﬁned as the worker-to-task assignment , i.e. salesman has to visit the assigned city.
Reward .
We formulate the problem in a delayed reward setting.
Speciﬁcally, the sparse reward function is deﬁned as r ( s τ ) =
for all non-terminal events, and r ( s T ) =
t (T) , where T is the index of the terminal state.
In other words, a single reward signal, which is obtained only for the terminal state, is equals to the makespan of the problem instance.
S CHEDULE N ET
Given the MDP formulation for MinMax mTSP, we propose ScheduleNet that can recommend a scheduling action a τ given the current state G τ represented as a graph, i.e., π θ ( a τ |G τ ) .
The SchedulNet ﬁrst presents a state (partial solution of mTSP) as a set of graphs, each of which captures speciﬁc relationships among workers, tasks, and a depot.
Then ScheduleNet employs type-aware graph attention (TGA) to compute the node embeddings and use the computed node embeddings to determine the next assignment action (See ﬁgure 2).
4. W ORKER -T ASK G RAPH R EPRESENTATION
Whenever an event occurs and the global state s τ of the MDP is updated at τ , ScheduleNet constructs a directed complete graph G τ =
( V , E ) out of s τ ,
where V = V T ∪ V C is the set of nodes and E is the set of edges.
We drop the time iterator τ to simplify the notations since the following operations only for the given time step.
The nodes and edges and their associated features are deﬁned as:
• v i denotes the node corresponding entity i in mTSP problem.
The node feature x i for v
i is equal to the state s iτ of entity i .
In addition, k i denote the type of node v i .
For instance, if the entity i is worker and its 1 activeτ = 1 , then the k i becomes active-worker type.
• e ij denotes the edge between between source node v j and destination node v i , representing the relationships between the two.
The edge feature w ij is equal to the Euclidean distance between the two nodes.
4. T YPE - AWARE G RAPH A TTENTION E MBEDDING
In this section, we describe a type-aware graph attention (TGA) embedding procedure.
We denote h i and h ij as the node and the edge embedding, respectively, at a given time step, and h (cid:48)
i and h (cid:48)
ij as the updated embedding by TGA embedding.
A single iteration of TGA embedding consists of three phases: (1) edge update, (2) message aggregation, and (3) node update.
Type-aware Edge update Given the node embeddings h i for v i ∈ V and the edge embeddings h ij for e ij ∈ E , ScheduleNet computes the updated edge embedding h (cid:48) ij and the attention logit z ij as:
[Equation]
ij
[Equation]
where TGA E and TGA A are, respectively, the type-aware edge update function and the type-aware attention function, which are deﬁned for the speciﬁc type k j of the source node v j .
The updated edge feature h (cid:48) ij can be thought of as the message from the source node v j to the destination node v i , and the attention logit z ij will be used to compute the importance of this message.
In computing the updated edge feature (message), TGA E and TGA
A ﬁrst compute the “type-aware” edge encoding u ij , which can be seen as a dynamic edge feature varying depending on the source node type, to effectively model the complex type-aware relationships among the nodes.
Using the computed “type-aware” edge encoding u ij , these two functions then compute the updated edge feature and attention logit using a multiplicative interaction (MI) layer (Jayakumar et al., 2019).
The use of MI layer signiﬁcantly reduces the number of parameters to learn without discarding the expressibility of the embedding procedure.
The detailed architecture for TGA E and TGA A are provided in Appendix A.4.
Type-aware Message aggregation
The distribution of the node types in the mTSP graphs is highly imbalanced, i.e., the number of task-speciﬁc node types is much larger than the worker speciﬁc ones.
This imbalance is problematic, speciﬁcally, during the message aggregation of GNN, since permutation invariant aggregation functions are akin to ignore messages from few-but-important nodes in the graph.
To alleviate such an issue, we propose the following type-aware message aggregation scheme.
We ﬁrst deﬁne the type k neighborhood of node v i as the set of the k typed source nodes that are connected to the destination node v i , i.e., N k
( i ) =
{ v l | k l = k, ∀ v l ∈ N ( i ) } , where N ( i ) is the in-neighborhood set of node v i containing the nodes that are connected to node v i with incomingedges.
The node v i aggregates separately messages from the same type of source nodes.
For example, the aggregated message m ki from k -type source nodes is computed as:
[Equation]
where α ij is the attention score computed using the attention logits computed before as:
[Equation]
Finally, all aggregated messages per type are concatenated to produce the total aggregated message m i for node v i as
[Equation]
Type-aware Node update
The aggregated message m i for node v
i is then used to compute the updated node embedding h (cid:48)
i using the type-aware graph node update function TGA V as:
[Equation]
4. A SSIGNMENT PROBABILITY COMPUTATION
ScheduleNet model consists of two type-aware graph embedding layers that utilize the embedding procedure explained in the section above.
The ﬁrst embedding layer raw-2-hid is used to encode initial node and edge features x i and w ij of the (full) graph G τ , to obtain initial hidden node and edge features h (0) i and h (0) ij , respectively.
We deﬁne the target subgraph G sτ as the subset of nodes and edges from the original (full) graph
G τ that only includes a target-worker (unassigned-worker) node and all unassigned-city nodes.
The second embedding layer hid-2-hid embeds the target subgraph G sτ , H times.
In other words, a hidden node and edge embeddings h (0) i and h (0) ij are iteratively updated H times to obtain ﬁnal hidden embeddings h ( H ) i and h ( H ) ij , respectively.
The ﬁnal hidden embeddings are then used to make decision regarding the worker-to-task assignment .
Speciﬁcally, probability of assigning target worker i to task j is computed as
[Equation]
where the h ( H ) i , and h ( H ) ij is the ﬁnal hidden node, edge embeddings, respectively.
In addition,
A ( G τ ) denote the set of feasible actions deﬁned as { v j | k j = “Unassigned-task” ∀ j ∈ V } .
T RAINING S CHEDULE N ET
In this section, we describe the training scheme of the ScheduleNet.
Firstly, we explain reward normalization scheme which is used to reduce the variance of the reward.
Secondly, we introduce a stable RL training scheme which signiﬁcantly stabilizes the training process.
Makespan normalization As mentioned in Section 3.1, we use the makespan of mTSP as the only reward signal for training RL agent.
We denote the makespan of given policy π as M ( π ) .
We observe that, the makespan M ( π ) is a highly volatile depending on the problem size (number of cities and salesmen), the topology of the map, and the policy.
To reduce the variance of the reward, we propose the following normalization scheme:
[Equation]
where π and π b is the evaluation and baseline policy, respectively.
The normalized makespan m ( π, π b ) is similar to (Kool et al., 2018), but we additionally divide the performance difference by the makespan of the baseline policy, which further reduces the variance that is induced by the size of the mTSP instance.
From the normalized terminal reward m ( π, π b ) , we compute the normalized return as follows:
[Equation]
where T is the index of the terminal state, and γ is the discount factor.
The normalized return G τ ( π, π b ) becomes smaller and converges to (near) zero as τ decreases.
From the perspective of the RL agent, it allows to the agent to acknowledge neutrality of current policy compared to the baseline policy for the early phase of the MDP trajectory.
It is natural since knowing the relative goodness of the policy is hard from the early phase of the MDP.
Stable RL training It is well known that the solution quality of CO problems, including the makespan of mTSP, is extremely sensitive to the action selection, and it thus prevents the stable policy learning.
To address this problem, we propose the clipped REINFORCE, a variant PPO without the learned value function.
We empirically found that it is hard to train the value function 1 , thus we use normalized returns Gτ ( π θ , π b ) directly.
Then, the objective of the clipped REINFORCE is given as follows:
[Equation]
where
[Equation]
[Table]
and ( G τ , a τ ) ∼ π θ is the state-action marginal following π θ , and π θ old is the old policy.
Training detail We used the greedy version of current policy as the baseline policy π b .
After updating the policy π θ , we smooth the parameters of policy π θ with the Polyak average (Polyak & Juditsky, 1992) to further stabilize policy training.
The pseudo code of training and network architecture is given in Appedix A.5.
[Table]
E XPERIMENTS
We train the ScheduleNet using mTSP instances whose number m of workers and the number N of tasks are sampled from m ∼ U (2 , 4) and N ∼ U (10 , 20) , respectively.
This trained ScheduleNet policy is then evaluated on the various dataset, including randomly generated uniform mTSP
6. M TSP RESULTS
Random mTSP results We ﬁrstly investigate the generalization performance of ScheduleNet on the randomly generated uniform maps with varying numbers of tasks and workers.
We report the results of OR-Tools and 2Phase heuristics; 2Phase Nearest Insertion (NI), 2Phase Farthest Insertion (FI), 2Phase Random Insertion (RI), and 2Phase Nearest Neighbor (NN).
The 2Phase heuristics construct sub-tours by (1) clustering cities with clustering algorithm, and (2) applying the TSP heuristics within the cluster.
The details of implementation are provided in the appendix.
Table 1 shows that ScheduleNet in overall produces a slightly longer makespan than OR-Tools even for the largesized mTSP instances.
As the complexity of the target mTSP instance increases, the gap between
ScheduleNet and OR-Tools decreases, even showing the cases where ScheduleNet outperforms ORTools.
To further clarify, ScheduleNet has potentials for winning the OR-Tools on small and large cases as shown in the ﬁgure 3.
This result empirically proves that ScheduleNet, even trained with small-sized mTSP instances, can solve large scale problems well.
Notably, on the large scale maps, 2-Phase heuristics show their general effectiveness due to the uniformity of the city positions.
It naturally invokes us to consider more realistic problems as discussed in the following section.
mTSPLib results The trained ScheduleNet is employed to solve the benchmark problems in mTSPLib, without additional training, to validate the generalization capability of ScheduleNet on unseen mTSP instances, where the problem structure can be completely different from the instances used during training.
Table 2 compares the performance of the ScheduleNet to other baseline models, including CPLEX (optimal solution), OR-Tools, and other meta-heuristics (Lupoaie et al., 2019);
self-organization Map (SOM), ant-colony Optimization (ACO), and evolutionary algorithm (EA).
We report the best known-upper bound for CPLEX results whenever the optimal solution is not known.
OR-Tools generally show promising results.
Interestingly, OR-Tools also discovers the solution even better than the known-upper bounds.
(e.g., eil76- m =5,7, rat99- m =5) That is possible for the large cases the search space of the exact method, CLPEX, becomes easily prohibitively large.
Our method shows the second-best performance following OR-tools.
The winning heuristic methods, 2Phase-NI/RI, shows drastic performance degradation on mTSPLib maps.
It is noteworthy that our method, even in the zero-shot setting, performs better than the meta-heuristic methods, which perform optimization to solve each benchmark problem.
6. E FFECTIVENESS OF THE PROPOSED TRAINING SCHEME
Figure 5 compares the training curves of ScheduleNet and its variants.
We ﬁrstly show the effectiveness of the proposed sparse reward compared to the dense reward functions; distance reward and distance-utilization reward.
The distance reward is deﬁned as the negative distance between the current worker position and the assigned city.
This reward function is often used for solving
TSP(Dai et al., 2016).
The distance-utilization is deﬁned as distance reward over the number of active workers.
This reward function aims to minimize the (sub) tour distances while maximizing the utilization of the workers.
The proposed sparse reward is the only reward function that can train
ScheduleNet stable and achieves the minimal gaps, also as shown in 5 [Left].
We also validate the effectiveness of Clipped REINFORCE compared to the actor-critic counterpart, PPO.
We use the same network architecture of the Clipped REINFORCE model for the actor and critic of the PPO model.
Counter to the common belief, The actor-critic method (PPO) is not superior to the actor-only method (Clipped REINFORCE) as shown in
[Right].
We hypothesize this phenomenon is because the training target of the critic (sampled makepsan) is highly volatile and multimodal as visualized in Figure 4 and the value prediction error would deteriorate the policy due to the bellman error propagation in actor-critic setup (Fujimoto et al., 2018).
CONCLUSION
We proposed ScheduleNet for solving MinMax mTSP, the problem seeking to minimize the total completion time for multiple workers to complete the geographically distributed tasks.
The use of type-aware graphs and the specially designed
TGA graph node embedding allows the trained ScheduleNet policy to induce the coordinated strategic subroutes of the workers and to be well transferred to unseen mTSP with any numbers of workers and tasks.
We have empirically shown that the proposed method achieves the performance comparable to Google OR-Tools, a highly optimized meta-heuristic baseline.
All in all, this study has shown the potential that the proposed ScheduleNet can be effectively used to schedule multiple vehicles for solving large-scale, practical, real-world applications.
A A PPENDIX A. D ETAILS OF MDP T RANSITION AND G RAPH F ORMULATION Event based MDP transition
The formulated semi-MDP for ScheduleNet is event-based.
Thus, whenever all workers are assigned to cities, the environment transits in time, until any of the workers arrives to the city (i.e. completes the task).
Arrival of the worker to the city is the event trigger, meanwhile the other assigned workers are still on the way to their correspondingly assigned cities.
We assume that each worker transits towards the assigned city with unit speed in the 2D Euclidean space, i.e. the distance travelled by each worker equals the time past between two consecutive MDP events.
Graph formulation In total our graph formulation includes seven mutually exclusive node type: (1) assigned-worker, (2) unassigned-worker, (3) inactive-worker, (4) assigned-city, (5) unassignedcity, (6) inactive-city, and (7) depot.
Here, the set of active workers (cities) is deﬁned by the union of assigned and unassigned workers (cities).
Inactive-city node refers to the city that has been already visited, while the inactive-worker node refers to the worker that has ﬁnished its route and returned to the depot.
A. D ETAILS OF IMPLEMENTATION
2phase mTSP heuristics 2phase heuristics for mTSP is an extension of well-known TSP heuristics to the m > 1 cases.
First, we perform K-means spatial clustering of cities in the mTSP instance, where K
= m .
Next, we apply TSP insertion heuristics (Nearest Insertion, Farthest Insertion,
Random Insertion, and Nearest Neighbour Insertion) for each cluster of cities.
It should be noted that, performance of the 2phase heuristics is highly depended on the spatial distribution of the cities on the map.
Thus 2phase heuristics perform particularly well on uniformly distributed random instances, where K-means clustering can obtain clusters with approximately same number of cities per cluster.
Proximal Policy Optimization Our implementation of PPO closely the standard implementation of
PPO2 from stable-baselines (Hill et al., 2018) with default hyperparameters, with modiﬁcations to allow for distributed training with Parameter Server.
A. C OMPUTATION TIME
Figure 6 shows the computation time curves as the function of number of cities (left), and number of workers (right).
Overall, ScheduleNet is faster than OR-Tools, and the difference in computation speed only increases with the problem size. Additionally, ScheduleNet’s computation time depends only on the problem size ( N + m ), whereas the computation time of OR-Tools on both the size of the problem and the topology of the underlying mTSP instance. In other words, the number of solutions searched by OR-Tools vary depending on the underlying problem. Another computational and practical advantage of the ScheduleNet is its invariance to the number of workers.
Computational complexity of ScheduleNet increases linearly with the number workers.
On the other hand, the search space of meta-heuristic algorithms drastically increase with the number of workers, possibly, due to the exponentially increasing number Subtour Elimination Constraints (SEC).
Particularly, we investigated that OR-Tools decreases the search space, by deactivating part of the workers, i.e. not utilizing all possible partial solutions (subtours).
As a result, Figure 6 shows that computation time of the OR-Tools actually decrease due to deactivation part of workers, at the expense of the decreasing solution quality.
A. D ETAILS OF T YPE - AWARE G RAPH A TTENTION E MBEDDING
In this section, we thoroughly describe a type-aware graph embedding procedure.
Similar to the main body, We overload notations for the simplicity of notation such that the input node and edge feature as h i and h ij , and the embedded node and edge feature h (cid:48)
i and h (cid:48) ij , respectively.
The proposed graph embedding step consists of three phases: (1) type-aware edge update, (2) typeaware message aggregation, and (3) type-aware node update.
Type-aware Edge update The edge update scheme is designed to reﬂect the complex type relationship among the entities while updating edge features.
First the context embedding c ij of edge e ij computed using the source node type k j such that:
[Equation]
where MLP etype is the edge type encoder.
The source node types are embedded into the context embedding c ij using MLP etype .
Next, the type-aware edge encoding u ij is computed using the
Multiplicative Interaction (MI) layer (Jayakumar et al., 2019) as follows:
[Equation]
where MI edge is the edge MI layer.
We utilize the MI layer, which dynamically generates its parameter depending on the context c ij and produces “type-aware” edge encoding u ij , to effectively model the complex type relationships among the nodes.
“type-aware” edge encoding u ij can be seen as a dynamic edge feature which varies depending on the source node type.
After the updated edge embedding h (cid:48) ij and its attention logit z ij is obtained as:
[Equation]
where MLP edge and MLP attn is the edge updater and logit function, respectively.
the edge updater and logit function produces updated edge embdding and logits from the “type-aware” edge.
The computation steps of equation 11, 12, and 13 are deﬁned as TGA E .
Similarly, the computation steps of equation 11, 12, and 14 are deﬁned as TGA A .
Message aggregation First, we deﬁne the type- k neighborhood of node v i such that N k
( i ) =
{ v l | k l = k, ∀ v l ∈ N ( i ) } , where N ( i ) is the in-neigborhood set of node i .
i.e., The type- k neighborhood is the set of edges heading to node i , and their source nodes have type k .
The proposed type-aware message aggregation procedure computes attention score α ij for the e ij , which starts from node j and heads to node i , such that:
[Equation]
Intuitively speaking, The proposed attention scheme normalizes the attention logits of incoming edges over the types.
Therefore, the attention scores sum up to 1 over each type- k neighborhood.
Next, the type- k neighborhood message m i,k for node v i is computed as:
[Equation]
In this aggregation step, the incoming messages of node i are aggregated type-wisely.
Finally, all incoming type neighborhood messages are concatenated to produce (inter-type) aggregated message m i for node v i , such that:
[Equation]
Node update Similar to the edge update phase, ﬁrst, the context embedding c
i is computed for each node v i :
[Equation]
where MLP ntype is the node type encoder.
Then, the updated hidden node embedding h (cid:48)
i is computed as below:
[Equation]
where u i = MI node ( m i , c i ) is the type-aware node embedding that is produced by MI node layer using aggregated messages m i and the context embedding c i .
The computation steps of equation 18, and 19 are deﬁned as TGA E .
The overall computation procedure TGA is illustrated in Figure 7.
A. D ETAILS OF S CHEDULE N ET TRAINING A.5. T RAINING PSEUDO CODE
In this section, we presents a pseudocode for training ScheduleNet.
Algorithm 1: ScheduleNet Training
Input: Training policy π θ
Output
Collect
θ ← θ α ∇ θ θ ) φ ← βφ + 1 − β ) θ
A.5. H YPERPARAMETERS
In this section, we fully explain hyperparameters of ScheduleNet.
Network Architecture We use the same hyperparmeters for the raw-2-hid TGA layer and the hid2-hid TGA layer.
MLP etype and MLP ntype has one hidden layer with 32 neurons and their output dimensions are both 32.
Both MI layers has 64 dimensional outputs.
MLP edge , MLP attn , and
MLP node has 2 hidden layers with 32 neurons.
MLP actor has 2 hidden layers and the hidden layers has 128 neurons each.
We use ReLU activation functions for all hidden layers.
The hidden graph embedding step H is two.
Training We use Adam (Kingma & Ba, 2014) with learning rate value of 0.001.
Inner updates steps
K is three.
The smoothing parameter β is 0.95.
A. T RANSFERABILITY T EST ON TSP ( m = 1 )
The trained ScheduleNet has been employed to solve random TSP instances.
Because ScheduleNet can be used to schedule any m number of workers, if we set m = 1 , it can be used to schedule TSP instance without further training.
Table 3 shows the results on this transferability experiments.
Table 3 shows that the trained ScheduleNet can solve reasonably well on random TSP instances, although ScheduleNet has never been exposed to such TSP instances.
Note that as the size of TSP increases, the gap between the ScheduleNet and other models becomes smaller.
If the ScheduleNet is trained with TSP instances with m = 1 , the performance can be further improved.
However, we did not try that experiment to check its transferability over different types of routing problems with different objectives.
[Table]
A. E XTENDED M TSPL IB RESULTS
M e t a - h e u r
i s ti c s
H e u r
i s ti c s m
C P
LE X
O R
S N
S O
M
A C
O
E A 2ph
a s e N I 2p
h a s e F I 2ph
a s e R I 2ph
a s e
NN e il  222 .
b e r li n  . .
.e
il  280 .
r a t  728 .
[Table]
a p
[Table]